Information retrieval can be achieved through computerized processes by generating a LIST of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabiLISTic, and language models. In this paper, a new methodology for matching function of Boolean retrieval systems is proposed and tried to extend postings LIST data structures and increase the efficiency of using postings LISTs and skips. The final effect of these considerations is in decreasing the search time.

This research uses the portable HPGe and NaI(Tl) detectors for Compton continuum suppression. In the LIST mode data acquisition technique, we did not use timing module and complicated experimental setup that recorded the time stamp of each event. The maximum suppression factor (SF) in Cs-137 point source was 3. 8. By using this technique, we can detect samples that contain very low radioactivity. The experimental setup in this research was based on analog nuclear electronic modules. The study's main goal was the ability of LIST-mode data acquisition in Compton continuum suppression. In this way, lower levels of radioactivity can be detected in any sample.

The k-deck of a graph is the multiset of its subgraphs induced by k vertices which is denoted by Dk(G). A graph or graph property is l-reconstructible if it is determined by the deck of subgraphs obtained by deleting l vertices. Manvel proved that from the (n−l)-deck of a graph and the numbers of vertices with degree i for all i, n−l ≤ i ≤ n−1, the degree LIST of the graph is determined. In this paper, we extend this result and prove that if G is a graph with n vertices, then from the (n−l)-deck of G and the numbers of vertices with degree i for all i, n−l ≤ i ≤ n−3, where l ≥ 4 and n ≥ l + 6, the degree LIST of the graph is determined