Search results for "construct"

Linking Service Climate and Disconfirmation of Expectations as Predictors of Customer Satisfaction: A Cross-Level Study1

2011

Research addressing customer satisfaction has not been conducted within an integrated framework. Two approaches have been developed separately with different levels of construct and analysis: organizational behavior and consumer behavior. Our research study provides an initial step in developing integrative strategies with the joint consideration of service climate and disconfirmation of expectations. We link these 2 concepts to customer satisfaction with services, using a cross-level approach. Data from 105 work units and 1,033 customers confirmed the existence of a dual corridor of relationships, with independent and significant links from disconfirmation and service climate to customer s…

Forbidden Factors and Fragment Assembly

2002

In this paper we approach the fragment assembly problem by using the notion of minimal forbidden factors introduced in previous paper. Denoting by M(w) the set of minimal forbidden factors of a word w, we first focus on the evaluation of the size of elements in M(w) and on designing of an algorithm to recover the word w from M(w). Actually we prove that for a word w randomly generated by a memoryless source with identical symbol probabilities, the maximal length m(w) of words in M(w) is logarithmic and that the reconstruction algorithm runs in linear time. These results have an interesting application to the fragment assembly problem, i.e. reconstruct a word w from a given set I of substrin…

3D Reconstruction of rough terrain for USARSim using a height-map method

2008

In this paper, a process for a simplified reconstruction of rough terrains from point clouds acquired using laser scanners is presented. The main idea of this work is to build height-maps which are level gray-scale images representing the ground elevation. These height-maps are generated from step-fields which can be represented by a set of side-by-side pillars. Although height-maps are a practical means for rough terrain reconstruction, it is not possible to represent two different elevations for a given location with one height-map. This is an important drawback as terrain point clouds can show different zones representing surfaces above other surfaces.In this paper, a methodology to crea…

Some Generalizations of a Simion Schmidt Bijection

2007

In 1985, Simion and Schmidt gave a constructive bijection φ from the set of all length (n-1) binary strings having no two consecutive 1s to the set of all length n permutations avoiding all patterns in {123,132,213}. In this paper, we generalize φ to an injective function from {0,1}n-1 to the set Sn of all length n permutations and derive from it four bijections φ : P →Q where P⊆{0,1}n-1 and Q ⊂ Sn. The domains are sets of restricted binary strings and the codomains are sets of pattern-avoiding permutations. As a particular case we retrieve the original Simion–Schmidt bijection. We also show that the bijections obtained are actually combinatorial isomorphisms, i.e. closeness-preserving bije…

Interactive Gradually Generating Relevance Query Refinement Under the Human-Mediated Scenario in Multilingual Settings

2016

As opposed to query modelling, relevance generating interactive query refinement (QR) is a technique aimed at exploiting syntax variations of gradually extended, being removed or replaced with some other keywords query, which depending on the factors like e.g. the information resource, the database structure, or the keyword alignment, facilitates significantly the searching process. Therefore our motivation is to explore the dynamism of the precision trend depended upon the factors analyzed. For a couple of language pairs which constitute multilingual settings, we develop a user-centred framework that imposes distributed search optimization. Our data set contains variety of query types subm…

A nicely behaved singular integral on a purely unrectifiable set

2001

We construct an example of a purely 1-unrectifiable AD-regular set E in the plane such that the limit

Left-to-right tree pattern matching

1991

We propose a new technique to construct left-to-right matching automata for trees. Our method is based on the novel concept of prefix unifcation which is used to compute a certain closure of the pattern set. From the closure a kind of deterministic matching automaton can be derived immediately. We also point out how to perform the construction incrementally which makes our approach suitable for applications in which pattern sets change dynamically, such as in the Knuth-Bendix completion algorithm.

Volumetric Reconstruction of Unorganized Set of Points with Implicit Surfaces

2005

Many solutions exist to rebuild a three-dimensional object represented by a set of points. The purpose of our work is to provide an automatic reconstruction from an unorganized cloud, describing an unknown shape, in the aim to compute its volume. The approach employed in this paper consists in filling the object's interior with isosurfaces of potential fields and to use their fusion property in order to find the full volume and the continuous shape of the sampled object. Thus, the first step of our reconstruction is to search a correct interior for the object described by the set of points. Then, comes the positioning of implicit primitives into the cloud, deep inside of it and close to the…

An experience in pedigree reconstruction based on likelihood methods using genetic markers

2007

First assessment of the vermetid reefs along the coasts of Favignana Island (Southern Tyrrhenian Sea)

2015

Intertidal vermetid reefs, particularly vulnerable to environmental changes and human activities, are now experiencing high mortality in several areas of the Mediterranean Sea. Since the increase of knowledge on this habitat is important for conservation purposes, we provide a first baseline assessment of the vermetid reefs along the coasts of the Favignana Island (Marine Protected Area “Egadi Islands”). Preliminary results showed the presence of a true reef, similar to a fringing reef, displaying at least three local patterns, distinguishable for width (from 2.3 to 15.5 m), height of the outer and of the inner margin (from 5.6 to 18 cm and from 8.3 to 26 cm, respectively) and number, width…