Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems

Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This approach models human based reasoning about such entities closer than other approaches. Any relationships between regions that we encounter in our daily life situations are normally formulated in natural language. For example, one can outline one's room plan to an expert by indicating which rooms should be connected to each other. Mereotopology as an area of QSR combines mereology, topology and algebraic methods. As mereotopology plays an important role in region based theories of space, our focus is on one of the most widely referenced formalisms for QSR, the region connection calculus (RCC). RCC is a first order theory based on a primitive connectedness relation, which is a binary symmetric relation satisfying some additional properties. By using this relation we can define a set of basic binary relations which have the property of being jointly exhaustive and pairwise disjoint (JEPD), which means that between any two spatial entities exactly one of the basic relations hold. Basic reasoning can now be done by using the composition operation on relations whose results are stored in a composition table. Relation algebras (RAs) have become a main entity for spatial reasoning in the area of QSR. These algebras are based on equational reasoning which can be used to derive further relations between regions in a certain situation. Any of those algebras describe the relation between regions up to a certain degree of detail. In this thesis we will use the method of splitting atoms in a RA in order to reproduce known algebras such as RCC15 and RCC25 systematically and to generate new algebras, and hence a more detailed description of regions, beyond RCC25.

Expenditure List

Expenditure list (7 pages, handwritten) divided into house expenditure, office expenditure, funeral expenditure, farm expenditure, amount paid to Maggie Marston and amount paid to Amy Miller [it is not clear whose estate this is], 1886-1887.

Expenditure List (2 pages)

Expenditure list (2 pages, handwritten) on estate [whose estate is unknown], 1886, 1889-1892.

Bureaucratic Corruption As a Constraint on Voter Choice

It Has Often Been Assumed That a Country's Tax Level, Tax Structure Progressivity and After-Tax Income Distribution Are Chosen by Voters Subject Only to Their Budget Constraints. This Paper Argues That At Certain Income Levels Voters' Decisions May Be Constrained by Bureaucratic Corruption. the Theoretical Arguments Are Developed in Asymmetry Limits the Capacity of the Fiscal System to Generate Revenues by Means of Direct Taxes. This Hypothesis Is Tested Witha Sample of International Data by Means of a Simultaneous Equation Model. the Distortions Resulting From Corruption Ar Captured Through Their Effects on a Latent Variable Defined As the Overall Fiscal Structure. Evidence Is Found of Causality Running From This Latent Variable to the Level of Taxes and the Degree of After Tax Inequality.

Automates à contraintes semilinéaires = Automata with a semilinear constraint

Cette thèse présente une étude dans divers domaines de l'informatique théorique de modèles de calculs combinant automates finis et contraintes arithmétiques. Nous nous intéressons aux questions de décidabilité, d'expressivité et de clôture, tout en ouvrant l'étude à la complexité, la logique, l'algèbre et aux applications. Cette étude est présentée au travers de quatre articles de recherche. Le premier article, Affine Parikh Automata, poursuit l'étude de Klaedtke et Ruess des automates de Parikh et en définit des généralisations et restrictions. L'automate de Parikh est un point de départ de cette thèse; nous montrons que ce modèle de calcul est équivalent à l'automate contraint que nous définissons comme un automate qui n'accepte un mot que si le nombre de fois que chaque transition est empruntée répond à une contrainte arithmétique. Ce modèle est naturellement étendu à l'automate de Parikh affine qui effectue une opération affine sur un ensemble de registres lors du franchissement d'une transition. Nous étudions aussi l'automate de Parikh sur lettres: un automate qui n'accepte un mot que si le nombre de fois que chaque lettre y apparaît répond à une contrainte arithmétique. Le deuxième article, Bounded Parikh Automata, étudie les langages bornés des automates de Parikh. Un langage est borné s'il existe des mots w_1, w_2, ..., w_k tels que chaque mot du langage peut s'écrire w_1...w_1w_2...w_2...w_k...w_k. Ces langages sont importants dans des domaines applicatifs et présentent usuellement de bonnes propriétés théoriques. Nous montrons que dans le contexte des langages bornés, le déterminisme n'influence pas l'expressivité des automates de Parikh. Le troisième article, Unambiguous Constrained Automata, introduit les automates contraints non ambigus, c'est-à-dire pour lesquels il n'existe qu'un chemin acceptant par mot reconnu par l'automate. Nous montrons qu'il s'agit d'un modèle combinant une meilleure expressivité et de meilleures propriétés de clôture que l'automate contraint déterministe. Le problème de déterminer si le langage d'un automate contraint non ambigu est régulier est montré décidable. Le quatrième article, Algebra and Complexity Meet Contrained Automata, présente une étude des représentations algébriques qu'admettent les automates contraints et les automates de Parikh affines. Nous déduisons de ces caractérisations des résultats d'expressivité et de complexité. Nous montrons aussi que certaines hypothèses classiques en complexité computationelle sont reliées à des résultats de séparation et de non clôture dans les automates de Parikh affines. La thèse est conclue par une ouverture à un possible approfondissement, au travers d'un certain nombre de problèmes ouverts.

Impact of the elderly on household health expenditure in Bihar and Kerala, India

Dans le contexte d’une population vieillissante, nous avons étudié l’impact de la présence de personnes âgées sur les dépenses catastrophiques de santé (DCS), ainsi que leur impact sur trois effets reliés (le fait d’éviter des traitements, la perte de revenu, et l’utilisation de sources de financement alternatives). Nous avons utilisé les données d’une enquête du National Sample Survey Organization (Inde) en 2004, portant sur les dépenses reliées à la santé. Nous avons choisi un état développé (Kerala) et un état en voie de développement (Bihar) pour faire une comparaison des effets de la présence de personnes âgées sur les ménages. Nous avons trouvé qu’il y avait plus de DCS au Kerala et que ceci était probablement lié à la présence accrue de personnes âgées au Kerala ce qui mène à plus de maladies chroniques. Nous avons supposé que l’utilisation de services de santé privés serait lié à une augmentation de DCS, mais l’effet a varié en fonction de l’état, du présence d’une personne âgée, et du type de service utilisé (ambulatoire ou hospitalisation). Nous avons aussi trouvé que les femmes âgées au Bihar utilisait les services de santé moins qu’elle ne devrait, que les ménages ayant plus de 4 personnes ont possiblement un effet protecteur pour les personnes âgées, et que certains castes et group religieux ont dû emprunter plus souvent que d’autres groupes pour payer les frais de santé. La présence de personnes âgées, les maladies chroniques, et l’utilisation de services de santé privées sont tous liés aux DCS, mais, d’après nos résultats, d’autres groupes retardent les conséquences économiques en empruntant ou évitant les traitements. Nous espérons que ces résultats seront utilisés pour approfondir les connaissances sur l’effet de personnes âgées sur les dépenses de santé ou qu’ils seront utilisés dans des discussions de politiques de santé.

Consumption Expenditure Pattern of Scheduled Caste Households of Kerala: a Study of Idukki District

The present study made an attempt to analyze the socio-economic background and the consumption pattern of scheduled caste households in Idukki district. The objectives of the study are to examine consumption pattern among the scheduled cast population, differences in the average consumption expenditure of different decile groups, consumption expenditure elasticity of items, variations in expenditure of SC households on food, non-food and total expenditure and to examine the association between consumption expenditure and variables such as income, education, occupation and area of residence. The study reveals that the Monthly Per Capita Expenditure of scheduled castes population in rural Kerala is lower than that of the general population. Average household size is higher in rural sector for Scheduled Caste in Kerala as well as all-India. The per capita expenditure of Scheduled Castes of rural Kerala is found to be much lower than that of general population. The study has found that the levels of livings of the Scheduled Castes are far the below the expectations. Large percentage of the Scheduled Caste belongs to the lower income groups. This is due their very low economic status and the consequent employment prospects in low paying occupations. The consumption standards of the majority of Scheduled Castes are found much below that of General population. Effective implementation of the Schemes for their economic upliftment is needed for improving their consumption standards, Minimum Wage Act in the case of agricultural labourers etc. are some of recommendations on the basis of this study.

Capital expenditure decision in private and public sector entreprises in India A comparative evaluation

This study is focussed on public and private sector The study is confined to industrial Public companies in the states of Kerala and Orissa along with companies in India. undertakings only. sector and private sector private sector companies in other states were studied. Even though the original plan of 190 companies as the sample size could not be accomplished, as the responses were very poor, but data could be collected frmn 6 public and 5 private sector companies in Kerala, 8 public and 8 private sector companies in Orissa along with 27 private sector companies in other states totalling to 54 companies. The number of years of data collected varies from 2 years to 6 years. Factors which are affecting capital expenditures and hence leading to the performance of private sector compared to public sector companies are studied. After the study and analysis, comparisons are made between public sector and private sector, and suitable recomendations are made so that public sector industries can also perform equally well as the private sector industries in India.

Stereo-Based Head Pose Tracking Using Iterative Closest Point and Normal Flow Constraint

In this text, we present two stereo-based head tracking techniques along with a fast 3D model acquisition system. The first tracking technique is a robust implementation of stereo-based head tracking designed for interactive environments with uncontrolled lighting. We integrate fast face detection and drift reduction algorithms with a gradient-based stereo rigid motion tracking technique. Our system can automatically segment and track a user's head under large rotation and illumination variations. Precision and usability of this approach are compared with previous tracking methods for cursor control and target selection in both desktop and interactive room environments. The second tracking technique is designed to improve the robustness of head pose tracking for fast movements. Our iterative hybrid tracker combines constraints from the ICP (Iterative Closest Point) algorithm and normal flow constraint. This new technique is more precise for small movements and noisy depth than ICP alone, and more robust for large movements than the normal flow constraint alone. We present experiments which test the accuracy of our approach on sequences of real and synthetic stereo images. The 3D model acquisition system we present quickly aligns intensity and depth images, and reconstructs a textured 3D mesh. 3D views are registered with shape alignment based on our iterative hybrid tracker. We reconstruct the 3D model using a new Cubic Ray Projection merging algorithm which takes advantage of a novel data structure: the linked voxel space. We present experiments to test the accuracy of our approach on 3D face modelling using real-time stereo images.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.

Reasoning about Temporal Context using Ontology and Abductive Constraint Logic Programming

The underlying assumptions for interpreting the meaning of data often change over time, which further complicates the problem of semantic heterogeneities among autonomous data sources. As an extension to the COntext INterchange (COIN) framework, this paper introduces the notion of temporal context as a formalization of the problem. We represent temporal context as a multi-valued method in F-Logic; however, only one value is valid at any point in time, the determination of which is constrained by temporal relations. This representation is then mapped to an abductive constraint logic programming framework with temporal relations being treated as constraints. A mediation engine that implements the framework automatically detects and reconciles semantic differences at different times. We articulate that this extended COIN framework is suitable for reasoning on the Semantic Web.