نتایج جستجو برای: simple

تعداد نتایج: 456944  

Journal: :Int. J. Applied Earth Observation and Geoinformation 2013
Nicola Clerici Peter Vogt

Riparian zones are of utmost importance in providing a wide range of ecological and societal services. Among these, their role in maintaining landscape connectivity through ecological corridors for animals and plants is of major interest from a conservation and management perspective. This paper describes a methodology to identify European regions as providers of structural riparian corridors, ...

2000
Azhar Quddus Faouzi Alaya Cheikh Moncef Gabbouj

In this paper we present a technique for shape similarity estimation and apply it to content-based indexing and retrieval over large image databases. This technique is based on wavelet decomposition and uses polygonal approximation. It uses simple features (aspect ratio, angles, distances from the centroid, distance ratios and relative positions) extracted at high curvature points. The experime...

2003
David Greve Matthew Wilding

We show a macro for introducing operations on typed records. The underlying theorems proved about these records include what is proved about records introduced using the standard ACL2 record book [2], as well as an additional theorem about the type of the elements. The standard ACL2 distribution contains a \records" book that provides an unconventional implementation of two functions: g (for \g...

2012
Li Wang Su Nam Kim Timothy Baldwin

Online discussion forums are a valuable means for users to resolve specific information needs, both interactively for the participants and statically for users who search/browse over historical thread data. However, the complex structure of forum threads can make it difficult for users to extract relevant information. Automatically identifying whether the problem in a thread has been solved or ...

Journal: :ECEASST 2013
Martin Hofmann Benjamin C. Pierce Daniel Wagner

We consider a simple set of edit operations for unordered, edge-labeled trees, called information trees by Dal Zilio et al [DLM04]. We define tree languages using the sheaves automata from [FPS07] which in turn are based on [DLM04] and provide an algorithm for deciding whether a complex edit preserves membership in a tree language. This allows us to view sheaves automata and subsets of tree edi...

2009
ROBERT P. KERTZ R. P. KERTZ

If X"0, Xx_ is an arbitrarily-dependent sequence of random variables taking values in [0,1] and if V( X0,X¡,... ) is the supremum, over stop rules /, of EX,, then the set of ordered pairs {(.*, v): x V(X0, Xx,.. .,Xn) and y £(maxyS„X¡) for some X0,..., Xn] is precisely the set C„= {(x,y):x<y<x(\ + n(\ *'/")); 0 « x « l}; and the set of ordered pairs {(x, y): x V(X0, X,,...) and y £(sup„ X„) for...

Journal: :Journal of theoretical biology 2001
R J Payne V A Jansen

Studies of bacteriophage as therapeutic agents have had mixed and unpredictable outcomes. We argue that interpretation of these apparently paradoxical results requires appreciation of various density-dependent threshold effects. We use a mathematical model to delineate different categories of outcome, including therapy by simple inundation, by active biocontrol, and by delayed active biocontrol...

2008
Gijs van den Broek Jürgen Schönwälder Aiko Pras Matús Harvan

The Network Management Research Group (NMRG) started an activity to collect traces of the Simple Network Management Protocol (SNMP) from operational networks. To analyze these traces, it is necessary to split potentially large traces into more manageable pieces that make it easier to deal with large data sets and simplify the analysis of the data. This document introduces some common definition...

2015
VASILIY A. PROKHOROV

We study a constructive method of rational approximation of analytic functions based on ideas of the theory of Hankel operators. Some properties of the corresponding Hankel operator are investigated. We also consider questions related to the convergence of rational approximants. Analogues of Montessus de Ballore’s and Gonchars’s theorems on the convergence of rows of Padé approximants are proved.

Journal: :J. Symb. Log. 2009
Barbara F. Csima Joseph R. Mileti

The Rainbow Ramsey Theorem is essentially an “anti-Ramsey” theorem which states that certain types of colorings must be injective on a large subset (rather than constant on a large subset). Surprisingly, this version follows easily from Ramsey’s Theorem, even in the weak system RCA0 of reverse mathematics. We answer the question of the converse implication for pairs, showing that the Rainbow Ra...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید