smoothing document language model with local word graph

ACM SIGIR; ACM SIGWEB

Estimation of wind erosion rates by using Cs-137 tracing technique: A case study in Tariat-Xilin Gol transect, Mongolian Plateau

Wind erosion is one of the major environmental problems in semi-arid and arid regions. Here we established the Tariat-Xilin Gol transect from northwest to southeast across the Mongolian Plateau, and selected seven sampling sites along the transect. We then estimated the soil wind erosion rates by using the Cs-137 tracing technique and examined their spatial dynamics. Our results showed that the Cs-137 inventories of sampling sites ranged from 265.63 +/- 44.91 to 1279.54 +/- 166.53 Bq.m(-2), and the wind erosion rates varied from 64.58 to 419.63 t.km(-2).a(-1) accordingly. In the Mongolia section of the transect (from Tariat to Sainshand), the wind erosion rate increased gradually with vegetation type and climatic regimes; the wind erosion process was controlled by physical factors such as annual precipitation and vegetation coverage, etc., and the impact of human activities was negligible. While in the China section of the transect (Inner Mongolia), the wind erosion rates of Xilin Hot and Zhengxiangbai Banner were thrice as much as those of Bayannur of Mongolia, although these three sites were all dominated by typical steppe. Besides the physical factors, higher population density and livestock carrying level should be responsible for the higher wind erosion rates in these two regions of Inner Mongolia.

NDVI spatial pattern and its differentiation on the Mongolian Plateau

GIMMS NDVI database and geo-statistics were used to depict the spatial distribution and temporal stability of NDVI on the Mongolian Plateau. The results demonstrated that: (1) Regions of interest with high NDVI indices were distributed primarily in forested mountainous regions of the east and the north, areas with low NDVI indices were primarily distributed in the Gobi desert regions of the west and the southwest, and areas with moderate NDVI values were mainly distributed in a middle steppe strap from northwest to southeast. (2) The maximum NDVI values maintained for the past 22 years showed little variation. The average NDVI variance coefficient for the 22-year period was 15.2%. (3) NDVI distribution and vegetation cover showed spatial autocorrelations on a global scale. NDVI patterns from the vegetation cover also demonstrated anisotropy; a higher positive spatial correlation was indicated in a NW-SE direction, which suggested that vegetation cover in a NW-SE direction maintained increased integrity, and vegetation assemblage was mainly distributed in the same specific direction. (4) The NDVI spatial distribution was mainly controlled by structural factors, 88.7% of the total spatial variation was influenced by structural and 11.3% by random factors. And the global autocorrelation distance was 1178 km, and the average vegetation patch length (NW-SE) to width (NE-SW) ratio was approximately 2.4:1.0.

Natural Language Syntax and First Order Preference

We have argued elsewhere that first order inference can be made more efficient by using non-standard syntax for first order logic. In this paper we show how a fragment of English syntax under Montague semantics provides the foundation of a new inference procedure. This procedure seems more effective than corresponding procedures based on either classical syntax of our previously proposed taxonomic syntax. This observation may provide a functional explanation for some of the syntactic structure of English.

Computational Consequences of Agreement and Ambiguity in Natural Language

The computer science technique of computational complexity analysis can provide powerful insights into the algorithm-neutral analysis of information processing tasks. Here we show that a simple, theory-neutral linguistic model of syntactic agreement and ambiguity demonstrates that natural language parsing may be computationally intractable. Significantly, we show that it may be syntactic features rather than rules that can cause this difficulty. Informally, human languages and the computationally intractable Satisfiability (SAT) problem share two costly computional mechanisms: both enforce agreement among symbols across unbounded distances (Subject-Verb agreement) and both allow ambiguity (is a word a Noun or a Verb?).

The Behavior Language; User's Guide

The Behavior Language is a rule-based real-time parallel robot programming language originally based on ideas from [Brooks 86], [Connell 89], and [Maes 89]. It compiles into a modified and extended version of the subsumption architecture [Brooks 86] and thus has backends for a number of processors including the Motorola 68000 and 68HCll, the Hitachi 6301, and Common Lisp. Behaviors are groups of rules which are activatable by a number of different schemes. There are no shared data structures across behaviors, but instead all communication is by explicit message passing. All rules are assumed to run in parallel and asynchronously. It includes the earlier notions of inhibition and suppression, along with a number of mechanisms for spreading of activation.

Advanced Programming Language Features for Executable Design Patterns "Better Patterns Through Reflection

The Design Patterns book [GOF95] presents 24 time-tested patterns that consistently appear in well-designed software systems. Each pattern is presented with a description of the design problem the pattern addresses, as well as sample implementation code and design considerations. This paper explores how the patterns from the "Gang of Four'', or "GOF'' book, as it is often called, appear when similar problems are addressed using a dynamic, higher-order, object-oriented programming language. Some of the patterns disappear -- that is, they are supported directly by language features, some patterns are simpler or have a different focus, and some are essentially unchanged.

Revised Report on the Algorithmic Language Scheme

Data and procedures and the values they amass, Higher-order functions to combine and mix and match, Objects with their local state, the message they pass, A property, a package, the control of point for a catch- In the Lambda Order they are all first-class. One thing to name them all, one things to define them, one thing to place them in environments and bind them, in the Lambda Order they are all first-class. Keywords: Scheme, Lisp, functional programming, computer languages.

Leveraging Learning and Language Via Communication Bootstrapping

In a Communication Bootstrapping system, peer components with different perceptual worlds invent symbols and syntax based on correlations between their percepts. I propose that Communication Bootstrapping can also be used to acquire functional definitions of words and causal reasoning knowledge. I illustrate this point with several examples, then sketch the architecture of a system in progress which attempts to execute this task.

Naive Physics, Event Perception, Lexical Semantics, and Language Acquisition

This thesis proposes a computational model of how children may come to learn the meanings of words in their native language. The proposed model is divided into two separate components. One component produces semantic descriptions of visually observed events while the other correlates those descriptions with co-occurring descriptions of those events in natural language. The first part of this thesis describes three implementations of the correlation process whereby representations of the meanings of whole utterances can be decomposed into fragments assigned as representations of the meanings of individual words. The second part of this thesis describes an implemented computer program that recognizes the occurrence of simple spatial motion events in simulated video input.

ARLO: Another Representation Language Offer

This paper describes ARLO, a representation language loosely modelled after Greiner and Lenant's RLL-1. ARLO is a structure-based representation language for describing structure-based representation languages, including itself. A given representation language is specified in ARLO by a collection of structures describing how its descriptions are interpreted, defaulted, and verified. This high level description is compiles into lisp code and ARLO structures whose interpretation fulfills the specified semantics of the representation. In addition, ARLO itself- as a representation language for expressing and compiling partial and complete language specifications- is described and interpreted in the same manner as the language it describes and implements. This self-description can be extended of modified to expand or alter the expressive power of ARLO's initial configuration. Languages which describe themselves like ARLO- provide powerful mediums for systems which perform automatic self-modification, optimization, debugging, or documentation. AI systems implemented in such a self-descriptive language can reflect on their own capabilities and limitations, applying general learning and problem solving strategies to enlarge or alleviate them.

Assimilation of New Information by a Natural Language Understanding System

This work describes a program, called TOPLE, which uses a procedural model of the world to understand simple declarative sentences. It accepts sentences in a modified predicate calculus symbolism, and uses plausible reasoning to visualize scenes, resolve ambiguous pronoun and noun phrase references, explain events, and make conditional predications. Because it does plausible deduction, with tentative conclusions, it must contain a formalism for describing its reasons for its conclusions and what the alternatives are. When an inconsistency is detected in its world model, it uses its recorded information to resolve it, one way or another. It uses simulation techniques to make deductions about creatures motivation and behavior, assuming they are goal-directed beings like itself.