The Dirichlet problem in convex bounded domains for operators with L8-coefficients

Wood, Ian; Hieber, M., (2007) 'The Dirichlet problem in convex bounded domains for operators with L8-coefficients', Differential and Integral Equations 20 pp.721-734 RAE2008

Project Sanitarium: gaming TB: a serious game for a serious problem

Collaborative projects between Industry and Academia provide excellent opportunities for learning. Throughout the academic year 2014-2015 undergraduates from the School of Arts, Media and Computer Games at Abertay University worked with academics from the Infection Group at the University of St Andrews and industry partners Microsoft and DeltaDNA. The result was a serious game prototype that utilized game design techniques and technology to demystify and educate players about the diagnosis and treatment of one of the world's oldest and deadliest diseases, Tuberculosis (TB). Project Sanitarium is a game incorporating a mathematical model that is based on data from real-world drug trials. This paper discusses the project design and development, demonstrating how the project builds on the successful collaborative pedagogical model developed by academic staff at Abertay University. The aim of the model is to provide undergraduates with workplace simulation, wider industry collaboration and access to academic expertise to solve challenging and complex problems.

The Offstage of Democracy: The Problem of Social Dialogue in John Dewey’s and Walter Lippmann’s Writings

The aim of this article is to present and discuss John Dewey’s and Walter Lippmann’s views on the problem of communication in a democratic society, particularly their views on the question of a role of communication in forming social processes. First part of the paper outlines the framework of this problem and its meaning to the question of possibility of democracy. Part two is concerned with anthropological and socio-political considerations: I discuss the Deweyan and the Lippmannian understanding of individual, society, intelligence and democracy. In part three I examine in detail the problem of communication, with special attention given to the questions of the role of communication in forming social processes, the foundations and conditions of communication, the debaters, and a subject matter of a debate as well as the questions of who and what forms this debate and whether we can form it altogether.

Problem ubóstwa w Unii Europejskiej

The issues of poverty, famine and malnutrition mainly concern underdeveloped regions. Yet in recent years the proportion of the population threatened with poverty and social exclu- sion has been growing not only in these regions but also in developed areas, including the EU. The issue of poverty is additionally related to demography. In this context, the aging popula- tion of West European countries is worrisome, as the elderly are one of the groups particularly threatened by poverty, and their number continues to grow. Appreciating the gravity of this is- sue, the European Commission considers the fight against poverty to be one of the basic five directions established in the Europe 2020 strategic document.

Sytuacja społeczna ludzi starych jako problem pedagogiczny

In the article were presented results and analysis of searches of social situation of older people. A general purpose of searches was to qualify outer impulses which are components of aspect of social situation and that how it is accepted by older people and how it stimulates their activity. Learning of social situation of older people allows to qualify specific methods of work with them on base of pedagogics.

Refugee Question as an International Global Problem

The problem of refugees is a phenomenon characteristic of contemporary international relations. It can take an individual form (as a result of individual persecutions of a racial, religious, national or political character) or the form of mass relocations, especially in the face of military conflicts or general breaching of human rights. The purpose of this paper is to present the refugee question as an international global problem that may appear in any region of the world, impacting the situation of states and societies, that is perceived as both a threat and a fundamental challenge for the entire international community.

Konwencja dotycząca statusu uchodźców a praktyka turecka. Problem przybyszów zza wschodniej granicy

Celem publikacji jest podjęcie próby przeanalizowania polityki, jaką Turcja prowadzi wobec obcokrajowców poszukujących schronienia na jej terytorium. O ważkości zagadnienia zadecydowała w ostatnich latach przede wszystkim tocząca się w Syrii wojna domowa, w wyniku której na terytorium Turcji znalazło się ponad 700 tysięcy Syryjczyków. Szczególne w tym kontekście kontrowersje budzi fakt stosowania przez Turcję podwójnych standardów w przedmiocie nadawania imigrantom konwencyjnego statusu uchodźcy. Państwo to, jako jedno z czterech na świecie, w momencie przystępowania do Konwencji dotyczącej statusu uchodźców i Protokołu nowojorskiego zastrzegło sobie prawo do stosowania w tej materii tzw. kryterium geograficznego. W efekcie, o ile status uchodźcy nadany być może osobom przybywającym zza zachodnich granic Turcji, o tyle uciekinierzy z państw takich, jak Syria, Iran, czy Irak z formalnego punktu widzenia są „poszukującymi schronienia” (tur. sığınmacı). To zaś oznacza brak ich konwencyjnej ochrony. Celem artykułu jest jednak nie tylko przeanalizowanie prawnego i rzeczywistego położenia, w jakim znajdują się ofiary syryjskiej wojny domowej, przybywające na terytorium Turcji, a także próba przewidzenia scenariusza rozwoju tejże sytuacji. Celem uczynienia analizy możliwie najbardziej rzetelną, odwołano się zarówno do anglo, jak i tureckojęzycznych materiałów źródłowych.

Asynchronous Auction for Distributed Nonlinear Resource Allocation Problem

Resource Allocation Problems (RAPs) are concerned with the optimal allocation of resources to tasks. Problems in fields such as search theory, statistics, finance, economics, logistics, sensor & wireless networks fit this formulation. In literature, several centralized/synchronous algorithms have been proposed including recently proposed auction algorithm, RAP Auction. Here we present asynchronous implementation of RAP Auction for distributed RAPs.

On trip planning queries in spatial databases

In this paper we discuss a new type of query in Spatial Databases, called Trip Planning Query (TPQ). Given a set of points P in space, where each point belongs to a category, and given two points s and e, TPQ asks for the best trip that starts at s, passes through exactly one point from each category, and ends at e. An example of a TPQ is when a user wants to visit a set of different places and at the same time minimize the total travelling cost, e.g. what is the shortest travelling plan for me to visit an automobile shop, a CVS pharmacy outlet, and a Best Buy shop along my trip from A to B? The trip planning query is an extension of the well-known TSP problem and therefore is NP-hard. The difficulty of this query lies in the existence of multiple choices for each category. In this paper, we first study fast approximation algorithms for the trip planning query in a metric space, assuming that the data set fits in main memory, and give the theory analysis of their approximation bounds. Then, the trip planning query is examined for data sets that do not fit in main memory and must be stored on disk. For the disk-resident data, we consider two cases. In one case, we assume that the points are located in Euclidean space and indexed with an Rtree. In the other case, we consider the problem of points that lie on the edges of a spatial network (e.g. road network) and the distance between two points is defined using the shortest distance over the network. Finally, we give an experimental evaluation of the proposed algorithms using synthetic data sets generated on real road networks.

On the Stable Paths Problem and a Restricted Variant

Interdomain routing on the Internet is performed using route preference policies specified independently, and arbitrarily by each Autonomous System in the network. These policies are used in the border gateway protocol (BGP) by each AS when selecting next-hop choices for routes to each destination. Conflicts between policies used by different ASs can lead to routing instabilities that, potentially, cannot be resolved no matter how long BGP is run. The Stable Paths Problem (SPP) is an abstract graph theoretic model of the problem of selecting nexthop routes for a destination. A stable solution to the problem is a set of next-hop choices, one for each AS, that is compatible with the policies of each AS. In a stable solution each AS has selected its best next-hop given that the next-hop choices of all neighbors are fixed. BGP can be viewed as a distributed algorithm for solving SPP. In this report we consider the stable paths problem, as well as a family of restricted variants of the stable paths problem, which we call F stable paths problems. We show that two very simple variants of the stable paths problem are also NP-complete. In addition we show that for networks with a DAG topology, there is an efficient centralized algorithm to solve the stable paths problem, and that BGP always efficiently converges to a stable solution on such networks.

The Cache Inference Problem and its Application to Content and Request Routing

In many networked applications, independent caching agents cooperate by servicing each other's miss streams, without revealing the operational details of the caching mechanisms they employ. Inference of such details could be instrumental for many other processes. For example, it could be used for optimized forwarding (or routing) of one's own miss stream (or content) to available proxy caches, or for making cache-aware resource management decisions. In this paper, we introduce the Cache Inference Problem (CIP) as that of inferring the characteristics of a caching agent, given the miss stream of that agent. While CIP is insolvable in its most general form, there are special cases of practical importance in which it is, including when the request stream follows an Independent Reference Model (IRM) with generalized power-law (GPL) demand distribution. To that end, we design two basic "litmus" tests that are able to detect LFU and LRU replacement policies, the effective size of the cache and of the object universe, and the skewness of the GPL demand for objects. Using extensive experiments under synthetic as well as real traces, we show that our methods infer such characteristics accurately and quite efficiently, and that they remain robust even when the IRM/GPL assumptions do not hold, and even when the underlying replacement policies are not "pure" LFU or LRU. We exemplify the value of our inference framework by considering example applications.

Anisotropic Interpolation on Graphs: The Combinatorial Dirichlet Problem

The combinatorial Dirichlet problem is formulated, and an algorithm for solving it is presented. This provides an effective method for interpolating missing data on weighted graphs of arbitrary connectivity. Image processing examples are shown, and the relation to anistropic diffusion is discussed.

A Fuzzy ARTMAP Nonparametric Probability Estimator For Nonstationary Pattern Recognition Problem

An incremental, nonparametric probability estimation procedure using the fuzzy ARTMAP neural network is introduced. In slow-learning mode, fuzzy ARTMAP searches for patterns of data on which to build ever more accurate estimates. In max-nodes mode, the network initially learns a fixed number of categories, and weights are then adjusted gradually.

A Solution of the Figure-ground Problem for Biological Vision

A neural network model of 3-D visual perception and figure-ground separation by visual cortex is introduced. The theory provides a unified explanation of how a 2-D image may generate a 3-D percept; how figures pop-out from cluttered backgrounds; how spatially sparse disparity cues can generate continuous surface representations at different perceived depths; how representations of occluded regions can be completed and recognized without usually being seen; how occluded regions can sometimes be seen during percepts of transparency; how high spatial frequency parts of an image may appear closer than low spatial frequency parts; how sharp targets are detected better against a figure and blurred targets are detector better against a background; how low spatial frequency parts of an image may be fused while high spatial frequency parts are rivalrous; how sparse blue cones can generate vivid blue surface percepts; how 3-D neon color spreading, visual phantoms, and tissue contrast percepts are generated; how conjunctions of color-and-depth may rapidly pop-out during visual search. These explanations arise derived from an ecological analysis of how monocularly viewed parts of an image inherit the appropriate depth from contiguous binocularly viewed parts, as during DaVinci stereopsis. The model predicts the functional role and ordering of multiple interactions within and between the two parvocellular processing streams that join LGN to prestriate area V4. Interactions from cells representing larger scales and disparities to cells representing smaller scales and disparities are of particular importance.

Bayes and empirical-Bayes multiplicity adjustment in the variable-selection problem

This paper studies the multiplicity-correction effect of standard Bayesian variable-selection priors in linear regression. Our first goal is to clarify when, and how, multiplicity correction happens automatically in Bayesian analysis, and to distinguish this correction from the Bayesian Ockham's-razor effect. Our second goal is to contrast empirical-Bayes and fully Bayesian approaches to variable selection through examples, theoretical results and simulations. Considerable differences between the two approaches are found. In particular, we prove a theorem that characterizes a surprising aymptotic discrepancy between fully Bayes and empirical Bayes. This discrepancy arises from a different source than the failure to account for hyperparameter uncertainty in the empirical-Bayes estimate. Indeed, even at the extreme, when the empirical-Bayes estimate converges asymptotically to the true variable-inclusion probability, the potential for a serious difference remains. © Institute of Mathematical Statistics, 2010.