The short-scan case in fan-beam computed tomography requires the introduction of a weighting function to handle redundant data. Parker introduced such a weighting function for a scan over pi plus the opening angle of the fan. In this article we derive a general class of weighting functions for arbitrary scan angles between pi plus fan angle and 2pi (over-scan). These weighting functions lead to...

Currently, in web page classification, Absolute Weighting Method is a common method to weight HTML main structure features. The disadvantage of the method is that weighting coefficient is a fixed value, which has different effects on the long and short text. So the influence of structure features on local text will be weakened with the length of local text increasing. To solve the problem, we p...

the aim of this study preparation of the predicted soil maps by using kriging and inverse distance weighting methods in east rangeland of semnan. sampling was done within each unit of sampling parallel transects and 1 vertical transect with 750m length. soil samples were taken from 0-20 cm in starting and ending points of each transect. there were used kriging and inverse distance weighting met...

The paper is concerned with weighting distributional features of words with the aim of improving their automatic semantic classification, a task relevant to a number of NLP applications such as lexicon acquisition or named entity recognition. The purpose of the paper is to bring attention to differences between two major weighting strategies: Discriminative Feature Weighting and Characteristic ...

The rapid growth of web applications increases the need to evaluate web applications objectively. In the past few years some valuable works like WebQEM tried to objectively evaluate the web applications. However, still weighting web attributes which is one step of evaluation of web applications is completely subjective, depending mostly on experts’ judgments. In this paper a two-step weighting ...

A k-edge-weighting w of a graph G is an assignment of an integer weight, w(e) ∈ {1, . . . , k}, to each edge e. An edge weighting naturally induces a vertex coloring c by defining c(u) = ∑ u∼e w(e) for every u ∈ V (G). A k-edge-weighting of a graph G is vertexcoloring if the induced coloring c is proper, i.e., c(u) ≠ c(v) for any edge uv ∈ E(G). Given a graph G and a vertex coloring c0, does th...

A primary concern when using local search methods for CNF satis ability is how to get rid of local minimas. Among many other heuristics, Weighting by Morris (1993) and Selman and Kautz (1993) works overwhelmingly better than others (Cha and Iwama 1995). Weighting increases the weight of each clause which is unsatis ed at a local minima. This paper introduces a more sophisticated weighting strat...

In speech perception, children give particular patterns of weight to different acoustic cues (their cue weighting). These patterns appear to change with increased linguistic experience. Previous speech perception research has found a positive correlation between more analytical cue weighting strategies and the ability to consciously think about and manipulate segment-sized units (phonemic aware...

Non-response is a problem which pervades almost all survey research. This paper reviews ways in which adjustments for the biasing effects of non-response can be made at the analysis stage. The emphasis is practical rather than theoretical. Practical constraints on the choice of weighting method (or whether to weight at all) are discussed, as well as statistical implications and how to assess th...