Tangible applications for regular objects:An end-user model for pervasive computing at home

This paper describes an end-user model for a domestic pervasive computing platform formed by regular home objects. The platform does not rely on pre-planned infrastructure; instead, it exploits objects that are already available in the home and exposes their joint sensing, actuating and computing capabilities to home automation applications. We advocate an incremental process of the platform formation and introduce tangible, object-like artifacts for representing important platform functions. One of those artifacts, the application pill, is a tiny object with a minimal user interface, used to carry the application, as well as to start and stop its execution and provide hints about its operational status. We also emphasize streamlining the user's interaction with the platform. The user engages any UI-capable object of his choice to configure applications, while applications issue notifications and alerts exploiting whichever available objects can be used for that purpose. Finally, the paper briefly describes an actual implementation of the presented end-user model. © (2010) by International Academy, Research, and Industry Association (IARIA).

The Impact of Extension and Ecosystem Services on Smallholders’ Credit Constraint.

On formal credit markets, access to formal credit and reasonable credit terms of smallholder farmers
in rural sub-Saharan Africa is limited due to adverse selection. Financial institutions operating in
rural areas often cannot distinguish between borrowers (farmers) that are creditworthy and those that
are not, thus, allocate limited resource to agriculture to reduce credit risk. In the presence of limited business quality signaling by smallholder farmers, financial institutions shall demand for collateral and/or offer unfavorable contract terms. Moreover, agricultural productivity of rural sub-Saharan
Africa, dominated by subsistence or small-scale farmers, is also negatively impacted by the adverse
effect of climate change. A strategy that may make the farming practices of smallholder farmer’s
climate resilient and profitable may also improve smallholder farmer's access to formal credit. This
study investigates to what extent participating in ecosystem and extension services (EES) programs
signals business quality of smallholders, thus granting them credit accessibility. We collected data
on 210 smallholder farmers in 2013, comprising farmers that receive payments for ecosystem
services (PES) and farm management training from the International Small Group Tree Planting
Program (TIST) Kenya to test the aforementioned theory empirically. We use game theory,
particularly a screening and sorting model, to illustrate the prospects for farmers with EES to access
formal credit and to improve their credit terms given that they receive PES and banking services
training. Furthermore, the PES’ long term duration (10 – 30 years) generates stable cash-flow which
may be perceived as collateral substitute. Results suggest that smallholder farmers in the TIST
program were less likely to be credit constraint compared to non-TIST farmers. Distance to market,
education, livestock and farm income are factors that determine access to credit from microfinance
institutions in rural Kenya. Amongst farmers that have obtained loans, those keeping business records
enjoy more favorable formal credit conditions. These farmers were observed to pay ca. 5 percent less
interest rate in microfinance charges. For TIST farmers, this type of farm management practices may
be attributed to the banking services and other training they receive within the program. While the
availability of classical collateral (farmlands) and PES may reduce interest rate, the latter was found
to be statistically insignificant. This research underlines the importance of an effective extension
services in rural areas of developing countries and the need to improve gains from conservation
agriculture and ensuing PES. The benefits associated with EES and PES may encompass agricultural
financing.

On the Merit of Selecting Different Belief Merging Operators

Belief merging operators combine multiple belief bases (a profile) into a collective one. When the conjunction of belief bases is consistent, all the operators agree on the result. However, if the conjunction of belief bases is inconsistent, the results vary between operators. There is no formal manner to measure the results and decide on which operator to select. So, in this paper we propose to evaluate the result of merging operators by using three ordering relations (fairness, satisfaction and strength) over operators for a given profile. Moreover, a relation of conformity over operators is introduced in order to classify how well the operator conforms to the definition of a merging operator. By using the four proposed relations we provide a comparison of some classical merging operators and evaluate the results for some specific profiles.

Revising Partial Pre-Orders with Partial Pre-Orders: A Unit-Based Revision Framework

Belief revision studies strategies about how agents revise their belief states when receiving new evidence. Both in classical belief revision and in epistemic revision, a new input is either in the form of a (weighted) propositional formula or a total
pre-order (where the total pre-order is considered as a whole).
However, in some real-world applications, a new input can be a partial pre-order where each unit that constitutes the partial pre-order is important and should be considered individually. To address this issue, in this paper, we study how a partial preorder representing the prior epistemic state can be revised by another partial pre-order (the new input) from a different perspective, where the revision is conducted recursively on the individual units of partial pre-orders. We propose different revision operators (rules), dubbed the extension, match, inner and outer revision operators, from different revision points of view. We also analyze several properties for these operators.

A comparison of merging operators in possibilistic logic.

In this paper, we compare merging operators in possibilistic logic. We rst propose an approach to evaluating the discriminating power of a merging operator. After that, we analyze the computational complexity of existing possibilistic merging operators. Finally, we consider the compatibility of possibilistic merging operators with propositional merging operators.

Two dimensional unital Riesz algebras, their representations and norms

We describe all two dimensional unital Riesz algebras and study representations of them in Riesz algebras of regular operators. Although our results are not complete, we do demonstrate that very varied behaviour can occur even though all these algebras can be given a Banach lattice algebra norm.

Generating analysis topology using virtual topology operators

Virtual topology operations have been utilized to generate an analysis topology definition suitable for downstream mesh generation. Detailed descriptions are provided for virtual topology merge and split operations for all topological entities, where virtual decompositions are robustly linked to the underlying geometry. Current virtual topology technology is extended to allow the virtual partitioning of volume cells. A valid description of the topology, including relative orientations, is maintained which enables downstream interrogations to be performed on the analysis topology description, such as determining if a specific meshing strategy can be applied to the virtual volume cells. As the virtual representation is a true non-manifold description of the sub-divided domain the interfaces between cells are recorded automatically. Therefore, the advantages of non-manifold modelling are exploited within the manifold modelling environment of a major commercial CAD system without any adaptation of the underlying CAD model. A hierarchical virtual structure is maintained where virtual entities are merged or partitioned. This has a major benefit over existing solutions as the virtual dependencies here are stored in an open and accessible manner, providing the analyst with the freedom to create, modify and edit the analysis topology in any preferred sequence.

Regular medication reviews for children and young people with ADHD

The National Institute for Health and Care Excellence's (2008) guidelines for the diagnosis and management of attention deficit hyperactivity disorder (ADHD) recommend a full clinical and psychological assessment by an appropriately trained clinician; this should include a detailed developmental and psychiatric history. Stimulant medications, which are Schedule II controlled drugs, are the most commonly prescribed medicines in the UK and across the world for the management of ADHD. Children and young people with a diagnosis of ADHD receiving these stimulant medications are required to attend regular review appointments with a consultant child and adolescent psychiatrist or specialist nurse under shared care guidelines with general practices, and it has long been recognized that appropriately educated nurses can assist in the management of ADHD. Owing to the pharmacological action of the stimulant medication on neurotransmission, there is potential for misuse and dependence. A growing body of evidence suggests that adolescents with ADHD can become involved in drug diversion and that the topic should be explored during assessment. The level of misuse of prescribed stimulants is increasing, and adolescents and young people with ADHD may misuse to enhance cognitive function for academic purposes. The following scenario highlights some of the challenges and opportunities for independent nurse prescribers working in child and adolescent mental health services.

Operators for Similarity Search: Semantics, Techniques and Usage Scenarios

This book provides a comprehensive tutorial on similarity operators. The authors systematically survey the set of similarity operators, primarily focusing on their semantics, while also touching upon mechanisms for processing them effectively.

The book starts off by providing introductory material on similarity search systems, highlighting the central role of similarity operators in such systems. This is followed by a systematic categorized overview of the variety of similarity operators that have been proposed in literature over the last two decades, including advanced operators such as RkNN, Reverse k-Ranks, Skyline k-Groups and K-N-Match. Since indexing is a core technology in the practical implementation of similarity operators, various indexing mechanisms are summarized. Finally, current research challenges are outlined, so as to enable interested readers to identify potential directions for future investigations.

In summary, this book offers a comprehensive overview of the field of similarity search operators, allowing readers to understand the area of similarity operators as it stands today, and in addition providing them with the background needed to understand recent novel approaches.