Spaces:
Runtime error
Runtime error
Thiago Vieira
commited on
Commit
•
b0902ae
1
Parent(s):
d4706b0
initial commit
Browse files- app.py +173 -0
- bm25Simple/__init__.py +75 -0
- content/CISI.ALL +0 -0
- content/CISI.BLN +86 -0
- content/CISI.QRY +1525 -0
- content/CISI.REL +3114 -0
- content/cisi.tar.gz +3 -0
- models/BM25Okapi.pkl +3 -0
- models/BM25Plus.pkl +3 -0
- models/BM25_simple.pkl +3 -0
- requirements.txt +6 -0
app.py
ADDED
@@ -0,0 +1,173 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import os
|
2 |
+
import pickle
|
3 |
+
import time
|
4 |
+
import streamlit as st
|
5 |
+
from rank_bm25 import BM25Okapi, BM25Plus
|
6 |
+
from bm25Simple import BM25Simple
|
7 |
+
|
8 |
+
path = os.path.dirname(__file__)
|
9 |
+
print(path)
|
10 |
+
|
11 |
+
def main():
|
12 |
+
|
13 |
+
st.set_page_config(
|
14 |
+
# Can be "centered" or "wide". In the future also "dashboard", etc.
|
15 |
+
layout="wide",
|
16 |
+
initial_sidebar_state="auto", # Can be "auto", "expanded", "collapsed"
|
17 |
+
# String or None. Strings get appended with "• Streamlit".
|
18 |
+
page_title="BM25 based Information Retrieval System",
|
19 |
+
page_icon="🔎", # String, anything supported by st.image, or None.
|
20 |
+
)
|
21 |
+
|
22 |
+
# LAYOUT
|
23 |
+
hide_menu_style = """
|
24 |
+
<style>
|
25 |
+
#MainMenu {visibility: hidden; }
|
26 |
+
footer {visibility: hidden;}
|
27 |
+
</style>
|
28 |
+
"""
|
29 |
+
st.markdown(hide_menu_style, unsafe_allow_html=True)
|
30 |
+
# padding = 2
|
31 |
+
# st.markdown(f""" <style>
|
32 |
+
# .reportview-container .main .block-container{{
|
33 |
+
# padding-top: {padding}rem;
|
34 |
+
# padding-right: {padding}rem;
|
35 |
+
# padding-left: {padding}rem;
|
36 |
+
# padding-bottom: {padding}rem;
|
37 |
+
# }} </style> """, unsafe_allow_html=True)
|
38 |
+
|
39 |
+
# horizontal radios
|
40 |
+
st.write(
|
41 |
+
'<style>div.row-widget.stRadio > div{flex-direction:row;}</style>', unsafe_allow_html=True)
|
42 |
+
|
43 |
+
# load documents
|
44 |
+
corpus = load_docs()
|
45 |
+
|
46 |
+
# load models
|
47 |
+
bm25_simple, bm25_okapi, bm25_plus = load_models()
|
48 |
+
|
49 |
+
# UI
|
50 |
+
# st.header(f':mag_right: {algo}')
|
51 |
+
st.header(':mag_right: BM25 based Information Retrieval System')
|
52 |
+
|
53 |
+
st.markdown('''
|
54 |
+
<a href="https://github.com/tcvieira/bm25-exercise-report" target="_blank" style="text-decoration: none;">
|
55 |
+
<img src="https://cdn-icons-png.flaticon.com/512/25/25231.png" width="30" height="30" alt="github repository"></img>
|
56 |
+
</a>git repository
|
57 |
+
''', unsafe_allow_html=True)
|
58 |
+
|
59 |
+
st.markdown('---')
|
60 |
+
|
61 |
+
with st.form("search_form"):
|
62 |
+
query = st.text_input(
|
63 |
+
'Query', 'How much do information retrieval and dissemination systems, as well as automated libraries, cost? Are they worth it to the researcher and to industry?')
|
64 |
+
st.caption('no text preprocessing')
|
65 |
+
|
66 |
+
with st.expander("Query Examples"):
|
67 |
+
st.markdown('''
|
68 |
+
- What systems incorporate multiprogramming or remote stations in information retrieval? What will be the extent of their use in the future?
|
69 |
+
- What problems and concerns are there in making up descriptive titles? What difficulties are involved in automatically retrieving articles from approximate titles?
|
70 |
+
- What is information science? Give definitions where possible.
|
71 |
+
- Some Considerations Relating to the Cost-Effectiveness of Online Services in Libraries
|
72 |
+
- A Fast Procedure for the Calculation of Similarity Coefficients in Automatic Classification
|
73 |
+
''')
|
74 |
+
|
75 |
+
submitted = st.form_submit_button('Search')
|
76 |
+
|
77 |
+
if submitted:
|
78 |
+
if query:
|
79 |
+
st.markdown('---')
|
80 |
+
|
81 |
+
col1, col2, col3 = st.columns(3)
|
82 |
+
|
83 |
+
with col1:
|
84 |
+
st.subheader('BM25 Simple')
|
85 |
+
|
86 |
+
bm25_simple_time, most_relevant_documents = search_docs(
|
87 |
+
bm25_simple, query, corpus)
|
88 |
+
st.caption(f'time: {bm25_simple_time}')
|
89 |
+
print_docs(most_relevant_documents)
|
90 |
+
|
91 |
+
with col2:
|
92 |
+
st.subheader('BM25OKapi')
|
93 |
+
|
94 |
+
bm25_okapi_time, most_relevant_documents = search_docs(
|
95 |
+
bm25_okapi, query, corpus)
|
96 |
+
st.caption(f'time: {bm25_okapi_time}')
|
97 |
+
print_docs(most_relevant_documents)
|
98 |
+
|
99 |
+
with col3:
|
100 |
+
st.subheader('BM25+')
|
101 |
+
|
102 |
+
bm25_plus_time, most_relevant_documents = search_docs(
|
103 |
+
bm25_plus, query, corpus)
|
104 |
+
st.caption(f'time: {bm25_plus_time}')
|
105 |
+
print_docs(most_relevant_documents)
|
106 |
+
else:
|
107 |
+
st.text('add some query')
|
108 |
+
|
109 |
+
|
110 |
+
def search_docs(model, query, corpus):
|
111 |
+
tokenized_query = query.split(" ")
|
112 |
+
|
113 |
+
start = time.time()
|
114 |
+
most_relevant_documents = model.get_top_n(
|
115 |
+
tokenized_query, corpus, 20)
|
116 |
+
elapsed = (time.time() - start)
|
117 |
+
return elapsed, most_relevant_documents[:20]
|
118 |
+
|
119 |
+
|
120 |
+
def print_docs(docs):
|
121 |
+
for index, doc in enumerate(docs):
|
122 |
+
st.markdown(f'''
|
123 |
+
<div style="text-align: justify">
|
124 |
+
<strong>{index+1}</strong>: {doc}
|
125 |
+
</div>
|
126 |
+
</br>
|
127 |
+
''', unsafe_allow_html=True)
|
128 |
+
|
129 |
+
|
130 |
+
@st.cache_resource
|
131 |
+
def load_docs():
|
132 |
+
# Processing DOCUMENTS
|
133 |
+
doc_set = {}
|
134 |
+
doc_id = ""
|
135 |
+
doc_text = ""
|
136 |
+
with open(path + '/content/CISI.ALL') as f:
|
137 |
+
lines = ""
|
138 |
+
for l in f.readlines():
|
139 |
+
lines += "\n" + l.strip() if l.startswith(".") else " " + l.strip()
|
140 |
+
lines = lines.lstrip("\n").split("\n")
|
141 |
+
for l in lines:
|
142 |
+
if l.startswith(".I"):
|
143 |
+
doc_id = int(l.split(" ")[1].strip())-1
|
144 |
+
elif l.startswith(".X"):
|
145 |
+
doc_set[doc_id] = doc_text.lstrip(" ")
|
146 |
+
doc_id = ""
|
147 |
+
doc_text = ""
|
148 |
+
else:
|
149 |
+
# The first 3 characters of a line can be ignored.
|
150 |
+
doc_text += l.strip()[3:] + " "
|
151 |
+
return list(doc_set.values())
|
152 |
+
|
153 |
+
|
154 |
+
@st.cache_resource
|
155 |
+
def load_models():
|
156 |
+
with open(path + '/models/BM25_simple.pkl', 'rb') as file:
|
157 |
+
bm25_simple: BM25Simple = pickle.load(file)
|
158 |
+
print(bm25_simple.corpus_size)
|
159 |
+
|
160 |
+
with open(path + '/models/BM25OKapi.pkl', 'rb') as file:
|
161 |
+
bm25_okapi: BM25Okapi = pickle.load(file)
|
162 |
+
print(bm25_okapi.corpus_size)
|
163 |
+
|
164 |
+
with open(path + '/models/BM25Plus.pkl', 'rb') as file:
|
165 |
+
bm25_plus: BM25Plus = pickle.load(file)
|
166 |
+
print(bm25_plus.corpus_size)
|
167 |
+
|
168 |
+
st.success("BM25 models loaded!", icon='✅')
|
169 |
+
return bm25_simple, bm25_okapi, bm25_plus
|
170 |
+
|
171 |
+
|
172 |
+
if __name__ == "__main__":
|
173 |
+
main()
|
bm25Simple/__init__.py
ADDED
@@ -0,0 +1,75 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import math
|
2 |
+
|
3 |
+
# Implementation from https://en.wikipedia.org/wiki/Okapi_BM25
|
4 |
+
|
5 |
+
|
6 |
+
class BM25Simple(object):
|
7 |
+
PARAM_K1 = 1.2
|
8 |
+
PARAM_B = 0.75
|
9 |
+
EPSILON = 0.25
|
10 |
+
|
11 |
+
def __init__(self, corpus):
|
12 |
+
self.corpus_size = len(corpus)
|
13 |
+
self.dl = [float(len(d)) for d in corpus]
|
14 |
+
self.avgdl = sum(self.dl) / self.corpus_size
|
15 |
+
self.corpus = corpus
|
16 |
+
self.f = []
|
17 |
+
self.df = {}
|
18 |
+
self.idf = {}
|
19 |
+
self.average_idf = 0
|
20 |
+
self._initialize()
|
21 |
+
|
22 |
+
def _initialize(self):
|
23 |
+
for document in self.corpus:
|
24 |
+
frequencies = {}
|
25 |
+
for word in document:
|
26 |
+
if word not in frequencies:
|
27 |
+
frequencies[word] = 0
|
28 |
+
frequencies[word] += 1
|
29 |
+
self.f.append(frequencies)
|
30 |
+
|
31 |
+
for word, freq in frequencies.items():
|
32 |
+
if word not in self.df:
|
33 |
+
self.df[word] = 0
|
34 |
+
self.df[word] += 1
|
35 |
+
|
36 |
+
for word, freq in self.df.items():
|
37 |
+
self.idf[word] = math.log(
|
38 |
+
self.corpus_size - freq + 0.5) - math.log(freq + 0.5)
|
39 |
+
|
40 |
+
self.average_idf = sum(
|
41 |
+
map(lambda k: float(self.idf[k]), self.idf.keys())) / len(self.idf.keys())
|
42 |
+
|
43 |
+
def _get_score(self, document, index):
|
44 |
+
score = 0
|
45 |
+
for word in document:
|
46 |
+
if word not in self.f[index]:
|
47 |
+
continue
|
48 |
+
idf = self.idf[word] if self.idf[word] >= 0 else self.EPSILON * \
|
49 |
+
self.average_idf
|
50 |
+
score += (idf * self.f[index][word] * (self.PARAM_K1 + 1)
|
51 |
+
/ (self.f[index][word] + self.PARAM_K1 * (1 - self.PARAM_B + self.PARAM_B * self.dl[index] / self.avgdl)))
|
52 |
+
return score
|
53 |
+
|
54 |
+
def _get_scores(self, document):
|
55 |
+
scores = []
|
56 |
+
for index in range(self.corpus_size):
|
57 |
+
score = self._get_score(document, index)
|
58 |
+
scores.append(score)
|
59 |
+
return scores
|
60 |
+
|
61 |
+
def get_scores(self, query, k=None):
|
62 |
+
"""Returns the `scores` of most relevant documents according to `query`"""
|
63 |
+
result = [(index, score)
|
64 |
+
for index, score in enumerate(self._get_scores(query))]
|
65 |
+
result.sort(key=lambda x: x[1], reverse=True)
|
66 |
+
_, scores = zip(*result)
|
67 |
+
return scores
|
68 |
+
|
69 |
+
def get_top_n(self, query, corpus, n=20):
|
70 |
+
"""Returns the `indexes` most relevant documents according to `query`"""
|
71 |
+
result = [(index, score)
|
72 |
+
for index, score in enumerate(self._get_scores(query))]
|
73 |
+
result.sort(key=lambda x: x[1], reverse=True)
|
74 |
+
indexes, _ = zip(*result)
|
75 |
+
return [corpus[i] for i in indexes[:n]]
|
content/CISI.ALL
ADDED
The diff for this file is too large to render.
See raw diff
|
|
content/CISI.BLN
ADDED
@@ -0,0 +1,86 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
#default_ct = 3;
|
2 |
+
#q1= #and ('titles', #or ('automatically', 'retrieving', 'problems',
|
3 |
+
'concerns', 'descriptive',
|
4 |
+
'approximate', 'difficulties',
|
5 |
+
'content', 'relevance','articles'));
|
6 |
+
#q2= #and (#or('data', 'information'),
|
7 |
+
#or('automatically', 'retrieved','requests',
|
8 |
+
'pertinent', 'response',
|
9 |
+
#not (#or ('articles', 'references')) ) );
|
10 |
+
#q3= #and ('information',#or ('science', 'definition'));
|
11 |
+
#q4= #or (#and ('image', 'recognition'),
|
12 |
+
#and ( #or ('printed', 'text'),
|
13 |
+
#or ('methods', 'automatically', 'transforming',
|
14 |
+
'computer-ready') ) );
|
15 |
+
#q5= #and (#or ('training', 'use', 'need', 'systems', 'problems'),
|
16 |
+
#or ('special', 'ordinary', 'proper',
|
17 |
+
'researchers', 'encounter'),
|
18 |
+
#or ('information', 'management', 'retrieval') );
|
19 |
+
#q6= #and (#or ('communication', 'verbal'),
|
20 |
+
#or ('possibilities', 'word', 'computers', 'humans') );
|
21 |
+
#q7= #and ( #or ('systems', 'data-processing',
|
22 |
+
'coded', 'printing', 'publishing'),
|
23 |
+
#or ('retrieval', 'byproduct', 'papers', 'computer', 'working',
|
24 |
+
'planned', 'saving', 'articles') );
|
25 |
+
#q8= #and (#or ('languages', 'indexing'),
|
26 |
+
#or ('information', 'retrieval', 'science') );
|
27 |
+
#q9= #and (#or ('information', 'retrieval', 'system', 'automatic',
|
28 |
+
'possibilities','inclusion', 'analysis'),
|
29 |
+
#or ('grammatical', 'contextual') );
|
30 |
+
#q10= #or (#and ('group', 'mathematics'),
|
31 |
+
#and ('mathematics',
|
32 |
+
#or ('abstract', 'information', 'retrieval') ) );
|
33 |
+
#q11= #and (#or ('need', 'information', 'scientific', 'research'),
|
34 |
+
#or ('consolidation', 'evaluation', 'retrieval') );
|
35 |
+
#q12= #and (#or ('publication', 'printing', 'distribution'),
|
36 |
+
#or ('methods', 'scientific', 'journals') );
|
37 |
+
#q13= #and (#or ('information', 'retrieval', 'dissemination', 'systems'),
|
38 |
+
#or ('criteria', 'evaluation', 'objective') );
|
39 |
+
#q14= #and ('medical', #or ('future', 'automatic')) ;
|
40 |
+
#q15= #and (#or ('cost', 'worth', 'industry'),
|
41 |
+
#or ('information', 'retrieval', 'dissemination', 'libraries'),
|
42 |
+
#or ('systems', 'automated', 'researcher', 'industry') );
|
43 |
+
#q16= #and (#or ('information', 'retrieval', 'systems'),
|
44 |
+
#or ('future', 'stations', 'remote') );
|
45 |
+
#q17= #and (#or ('output', 'obtaining', 'usable', 'customer',
|
46 |
+
'volume', 'speed'),
|
47 |
+
#or ('information', 'retrieval'),
|
48 |
+
#or ('large', 'high', 'customer', 'volume', 'output') );
|
49 |
+
#q18= #and(#or ('structures', 'structural', 'formulas', 'drawing',
|
50 |
+
'compounds', 'chemical'),
|
51 |
+
#or ('methods', 'automatically',
|
52 |
+
'extended', 'encoding', 'matching'));
|
53 |
+
#q19= #and (#or ('matching', 'searching', 'coding'),
|
54 |
+
#or ('methods', 'machine', 'techniques', 'systems') );
|
55 |
+
#q20= #and ('testing', #or ('systems', 'automated', 'information') );
|
56 |
+
#q21= #and ('personnel', #or ('need', 'provide', 'information', 'field') );
|
57 |
+
#q22= #and ('medical', #or ('automated', 'information', 'field') );
|
58 |
+
#q23= #and ( 'libraries',
|
59 |
+
#or ('books', 'use', 'relation', 'systems', 'amount'),
|
60 |
+
#or ('automated', 'information') );
|
61 |
+
#q24= #and(#or ('education', 'training', 'needs', 'programs'),
|
62 |
+
#or ('possibilities', 'personnel', 'providing', 'requirements'),
|
63 |
+
#or ('information', 'field') );
|
64 |
+
#q25= #and ('international', #or ('systems', 'exchange', 'dissemination',
|
65 |
+
'information') );
|
66 |
+
#q26= #and ('cost', #or ('systems', 'automated',
|
67 |
+
'information', 'determination'));
|
68 |
+
#q27= #and (#or ('computerized', 'systems'),
|
69 |
+
#or ('indexing', 'information', 'retrieval'));
|
70 |
+
#q28= #and ('chemistry', #or ('computerized', 'systems', 'information') );
|
71 |
+
#q29= #and (#or ('specific', 'index', 'advantages'),
|
72 |
+
#or ('computerized', 'index', 'systems') );
|
73 |
+
#q30= #and (#or ('journals', 'periodicals'),
|
74 |
+
#or ('information', 'dissemination') );
|
75 |
+
#q31= #and (#or ('physical', 'sciences'), #or ('information', 'systems') );
|
76 |
+
#q32= #or (#and ('libraries',
|
77 |
+
#or ('general', 'computerized', 'mechanized', 'systems')),
|
78 |
+
#and (#or ('problems', 'methods', 'systems', 'indexing'),
|
79 |
+
#or ('indexing', 'automated', 'author', 'title')) );
|
80 |
+
#q33= #and (#or ('distance', 'transmission'),
|
81 |
+
#or ('retrieval', 'systems', 'automated', 'information') );
|
82 |
+
#q34= #and (#or ('coding', 'index', 'methods'),
|
83 |
+
#or ('methods', 'computerized', 'systems') );
|
84 |
+
#q35= #and ('government',
|
85 |
+
#or ('information', 'dissemination', 'agencies', 'projects') );
|
86 |
+
#endcoll;
|
content/CISI.QRY
ADDED
@@ -0,0 +1,1525 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
.I 1
|
2 |
+
.W
|
3 |
+
What problems and concerns are there in making up descriptive titles?
|
4 |
+
What difficulties are involved in automatically retrieving articles from
|
5 |
+
approximate titles?
|
6 |
+
What is the usual relevance of the content of articles to their titles?
|
7 |
+
.I 2
|
8 |
+
.W
|
9 |
+
How can actually pertinent data, as opposed to references or entire articles
|
10 |
+
themselves, be retrieved automatically in response to information requests?
|
11 |
+
.I 3
|
12 |
+
.W
|
13 |
+
What is information science? Give definitions where possible.
|
14 |
+
.I 4
|
15 |
+
.W
|
16 |
+
Image recognition and any other methods of automatically
|
17 |
+
transforming printed text into computer-ready form.
|
18 |
+
.I 5
|
19 |
+
.W
|
20 |
+
What special training will ordinary researchers and businessmen need for proper
|
21 |
+
information management and unobstructed use of information retrieval systems?
|
22 |
+
What problems are they likely to encounter?
|
23 |
+
.I 6
|
24 |
+
.W
|
25 |
+
What possibilities are there for verbal communication between computers and
|
26 |
+
humans, that is, communication via the spoken word?
|
27 |
+
.I 7
|
28 |
+
.W
|
29 |
+
Describe presently working and planned systems for publishing and printing
|
30 |
+
original papers by computer, and then saving the byproduct, articles coded in
|
31 |
+
data-processing form, for further use in retrieval.
|
32 |
+
.I 8
|
33 |
+
.W
|
34 |
+
Describe information retrieval and indexing in other languages.
|
35 |
+
What bearing does it have on the science in general?
|
36 |
+
.I 9
|
37 |
+
.W
|
38 |
+
What possibilities are there for automatic grammatical and contextual analysis
|
39 |
+
of articles for inclusion in an information retrieval system?
|
40 |
+
.I 10
|
41 |
+
.W
|
42 |
+
The use of abstract mathematics in information retrieval, e.g. group theory.
|
43 |
+
.I 11
|
44 |
+
.W
|
45 |
+
What is the need for information consolidation, evaluation, and retrieval in
|
46 |
+
scientific research?
|
47 |
+
.I 12
|
48 |
+
.W
|
49 |
+
Give methods for high speed publication, printing, and distribution of
|
50 |
+
scientific journals.
|
51 |
+
.I 13
|
52 |
+
.W
|
53 |
+
What criteria have been developed for the objective evaluation of information
|
54 |
+
retrieval and dissemination systems?
|
55 |
+
.I 14
|
56 |
+
.W
|
57 |
+
What future is there for automatic medical diagnosis?
|
58 |
+
.I 15
|
59 |
+
.W
|
60 |
+
How much do information retrieval and dissemination systems, as well as
|
61 |
+
automated libraries, cost?
|
62 |
+
Are they worth it to the researcher and to industry?
|
63 |
+
.I 16
|
64 |
+
.W
|
65 |
+
What systems incorporate multiprogramming or remote stations in information
|
66 |
+
retrieval? What will be the extent of their use in the future?
|
67 |
+
.I 17
|
68 |
+
.W
|
69 |
+
Means of obtaining large volume, high speed, customer usable
|
70 |
+
information retrieval output.
|
71 |
+
.I 18
|
72 |
+
.W
|
73 |
+
What methods are there for encoding, automatically matching,
|
74 |
+
and automatically drawing structures extended in two dimensions,
|
75 |
+
like the structural formulas for chemical compounds?
|
76 |
+
.I 19
|
77 |
+
.W
|
78 |
+
Techniques of machine matching and machine searching systems.
|
79 |
+
Coding and matching methods.
|
80 |
+
.I 20
|
81 |
+
.W
|
82 |
+
Testing automated information systems.
|
83 |
+
.I 21
|
84 |
+
.W
|
85 |
+
The need to provide personnel for the information field.
|
86 |
+
.I 22
|
87 |
+
.W
|
88 |
+
Automated information in the medical field.
|
89 |
+
.I 23
|
90 |
+
.W
|
91 |
+
Amount of use of books in libraries.
|
92 |
+
Relation to need for automated information systems .
|
93 |
+
.I 24
|
94 |
+
.W
|
95 |
+
Educational and training requirements for personnel in the information field.
|
96 |
+
Possibilities for this training. Needs for programs providing this training.
|
97 |
+
.I 25
|
98 |
+
.W
|
99 |
+
International systems for exchange and dissemination of information.
|
100 |
+
.I 26
|
101 |
+
.W
|
102 |
+
Cost and determination of cost associated with systems of automated information.
|
103 |
+
.I 27
|
104 |
+
.W
|
105 |
+
Computerized information retrieval systems. Computerized indexing systems.
|
106 |
+
.I 28
|
107 |
+
.W
|
108 |
+
Computerized information systems in fields related to chemistry.
|
109 |
+
.I 29
|
110 |
+
.W
|
111 |
+
Specific advantages of computerized index systems.
|
112 |
+
.I 30
|
113 |
+
.W
|
114 |
+
Information dissemination by journals and periodicals.
|
115 |
+
.I 31
|
116 |
+
.W
|
117 |
+
Information systems in the physical sciences.
|
118 |
+
.I 32
|
119 |
+
.W
|
120 |
+
Attempts at computerized and mechanized systems for general libraries.
|
121 |
+
Problems and methods of automated general author and title indexing systems.
|
122 |
+
.I 33
|
123 |
+
.W
|
124 |
+
Retrieval systems which provide for the automated transmission of information
|
125 |
+
to the user from a distance.
|
126 |
+
.I 34
|
127 |
+
.W
|
128 |
+
Methods of coding used in computerized index systems.
|
129 |
+
.I 35
|
130 |
+
.W
|
131 |
+
Government supported agencies and projects dealing with information dissemination.
|
132 |
+
.I 36
|
133 |
+
.W
|
134 |
+
What are some of the theories and practices in computer translating of
|
135 |
+
texts from one national language to another? How can machine translating
|
136 |
+
compete with traditional methods of translating in comprehending nuances
|
137 |
+
of meaning in languages of different structures?
|
138 |
+
|
139 |
+
.I 37
|
140 |
+
.W
|
141 |
+
What lists of words useful for indexing or classifying material are
|
142 |
+
available? Wanted are lists of terms that are descriptive vocabularies
|
143 |
+
of particular fields or schedules of words that are related to each other
|
144 |
+
in meaningful schemes. Wanted are lists that have been tested, at least to
|
145 |
+
some extent, and found useful for organizing material and for retrieving it.
|
146 |
+
|
147 |
+
.I 38
|
148 |
+
.W
|
149 |
+
How can access words in an information retrieval system be kept up to date?
|
150 |
+
Word meanings and usage often change and lists must be dynamic to be current.
|
151 |
+
What definitions of the problem and progress toward solutions have been made
|
152 |
+
in providing necessary flexibility in systems of subject headings, index
|
153 |
+
words, or other symbols used for getting at stored data?
|
154 |
+
|
155 |
+
.I 39
|
156 |
+
.W
|
157 |
+
The progress of information retrieval presents problems of maladjustment
|
158 |
+
and dislocation of personnel. Training and retraining of people to use
|
159 |
+
the new equipment is important at all levels. Librarians, assistants,
|
160 |
+
technicians, students, researchers, and even executives will need education
|
161 |
+
to learn the purpose, values, and uses of information systems and hardware.
|
162 |
+
What programs have been developed to change the attitudes and skills of
|
163 |
+
traditional workers and help them to learn the newer techniques?
|
164 |
+
|
165 |
+
.I 40
|
166 |
+
.W
|
167 |
+
What is the status of machine translation? What progress has been
|
168 |
+
made in the use of computers to transfer from one language to another
|
169 |
+
with some degree of automation? What problems and stumbling blocks
|
170 |
+
have been found and are they considered to be insurmountable limitations
|
171 |
+
or only challenging to the field of documentation on an international scale?
|
172 |
+
|
173 |
+
.I 41
|
174 |
+
.W
|
175 |
+
Is alphabetical ordering of material considered to be a useful tool in
|
176 |
+
information retrieval? What studies have been done to compare the
|
177 |
+
effectiveness of alphabetical order with other organization schemes?
|
178 |
+
Is there a generally accepted form of arranging material in
|
179 |
+
alphabetical order, and is there an easy way of achieving this form
|
180 |
+
without going to a great amount of effort?
|
181 |
+
|
182 |
+
.I 42
|
183 |
+
.W
|
184 |
+
The average student or researcher has difficulty in comprehending the
|
185 |
+
vocabulary of information retrieval. It appears important that this
|
186 |
+
new field be understood before it is to be fully accepted. What basic
|
187 |
+
articles would provide an understanding of the various important aspects
|
188 |
+
of the information storage and retrieval?
|
189 |
+
|
190 |
+
.I 43
|
191 |
+
.W
|
192 |
+
The difficulties encountered in information retrieval systems are often
|
193 |
+
less related to the equipment used than to the failure to plan
|
194 |
+
adequately for document analysis, indexing, and machine coding. The
|
195 |
+
position of the programmer is to take a problem and write it in a way
|
196 |
+
in which the equipment will understand. What articles have been written
|
197 |
+
describing research in maximizing the effectiveness of programming?
|
198 |
+
|
199 |
+
.I 44
|
200 |
+
.W
|
201 |
+
There are presently fifty to one hundred technical journals being
|
202 |
+
published. On the average, two new journals appear every day. In
|
203 |
+
the many journals published, one to two million articles appear every
|
204 |
+
year. What attempts have been made to cope with this amount of
|
205 |
+
scientific and technical publication in terms of analysis, control,
|
206 |
+
storage, and retrieval?
|
207 |
+
|
208 |
+
.I 45
|
209 |
+
.W
|
210 |
+
I am looking for information about the impact of automation on
|
211 |
+
libraries and its significance for libraries in general. This includes
|
212 |
+
the increasing importance of automation in view of the proliferation of
|
213 |
+
information today, and how automation can help libraries cope with
|
214 |
+
this problem. How will automation affect libraries and how should they
|
215 |
+
react to the idea of automation?
|
216 |
+
|
217 |
+
.I 46
|
218 |
+
.W
|
219 |
+
I am seeking information on the use of data processing in libraries and
|
220 |
+
the mechanization of routine library processes and procedures. I would
|
221 |
+
like descriptions of both general and specific applications of
|
222 |
+
automation in such areas as circulation, cataloging, acquisitions,
|
223 |
+
serial records, and other record-keeping. Examples should be based on
|
224 |
+
the operation of a conventional public or university library, or
|
225 |
+
practices in a special library which could also be applied in a public
|
226 |
+
or university library. Give descriptions of equipment and operations,
|
227 |
+
both present and projected.
|
228 |
+
|
229 |
+
.I 47
|
230 |
+
.W
|
231 |
+
Is there any established means at present for an international exchange
|
232 |
+
of material about information retrieval? If there is, does it take
|
233 |
+
the form of an international agency or center which regularly
|
234 |
+
distributes information retrieval methods and research results? If
|
235 |
+
there is not, in what ways has this material crossed national
|
236 |
+
boundaries? What seem to have been some of the problems blocking a
|
237 |
+
better international exchange, and is any effort being made to solve
|
238 |
+
some of those problems?
|
239 |
+
|
240 |
+
.I 48
|
241 |
+
.W
|
242 |
+
Information retrieval is still such a new and experimental field that a
|
243 |
+
line distinguishing research and practice is often difficult - even
|
244 |
+
impossible - to draw. Are there, however, actual centers of research
|
245 |
+
on information retrieval? If so, in which countries are they
|
246 |
+
located? Who supports them - government, business, universities, or
|
247 |
+
libraries? Can information retrieval as a specialized research
|
248 |
+
discipline be said to be emerging, or is it still an amalgam of skills
|
249 |
+
from other fields, such as mathematics, engineering, and library
|
250 |
+
science? In other words, tell me about information retrieval research.
|
251 |
+
|
252 |
+
.I 49
|
253 |
+
.W
|
254 |
+
Most resources have been spent on applying information retrieval
|
255 |
+
techniques to the physical and medical sciences. But, has information
|
256 |
+
retrieval been used at all in the natural sciences, social sciences,
|
257 |
+
and humanities? If so, what have been some of the problems which have
|
258 |
+
been encountered with these subject areas and how have they been
|
259 |
+
solved, if at all? Have the characteristics of these subject areas
|
260 |
+
necessitated the development of new information retrieval techniques?
|
261 |
+
What are the prospcts for future machine control in these areas?
|
262 |
+
|
263 |
+
.I 50
|
264 |
+
.W
|
265 |
+
Is there any use for traditional classification schemes - DDC, UDC, LC,
|
266 |
+
etc. - in information retrieval systems? If there is, which scheme
|
267 |
+
appears most suited to machine use and where has it been applied?
|
268 |
+
If there is not, why are these classification schemes irrelevant?
|
269 |
+
Has research shown that a subject classification of knowledge is
|
270 |
+
completely unnecessary in machine systems? Or, have new schemes
|
271 |
+
been devised which appear to be more suited to machine use?
|
272 |
+
|
273 |
+
.I 51
|
274 |
+
.W
|
275 |
+
Coordinate indexing utilizes descriptors for controlled language. Of
|
276 |
+
what use are descriptors in the construction of an index? How can
|
277 |
+
descriptors be used for searching in an information retrieval system?
|
278 |
+
|
279 |
+
.I 52
|
280 |
+
.W
|
281 |
+
What are the characteristics of MEDLARS (Medical Literature Analysis
|
282 |
+
and Retrieval System) project which has been undertaken by the
|
283 |
+
National Library of Medicine? How does it index current medical
|
284 |
+
journals and of what relation is this indexing system to Index Medicus?
|
285 |
+
What are the major components of the MEDLARS project and its major operating
|
286 |
+
details?
|
287 |
+
|
288 |
+
.I 53
|
289 |
+
.W
|
290 |
+
How can the computer be used in medical science for diagnostic and
|
291 |
+
clinical record keeping purposes? Have any programs of automation
|
292 |
+
been tried in hospitals? If so, what have been the results?
|
293 |
+
What problems have been encountered in the use of automation in
|
294 |
+
medicine? For what purposes can an automated system of clinical
|
295 |
+
records be used? What are other possible uses of the computer in medicine?
|
296 |
+
|
297 |
+
.I 54
|
298 |
+
.W
|
299 |
+
What is the effect on librarians of automation? Note the new types
|
300 |
+
of technology to be used in the library which will have an effect on
|
301 |
+
the status, position, and function of the librarians. What changes
|
302 |
+
are being contemplated or have been initiated to introduce automation
|
303 |
+
into the education of librarians?
|
304 |
+
|
305 |
+
.I 55
|
306 |
+
.W
|
307 |
+
What are the aims and objectives of the medical literature analysis
|
308 |
+
and retrieval system (MEDLARS)? How does MEDLARS operate? What are
|
309 |
+
the possible applications of MEDLARS to future information retrieval
|
310 |
+
systems?
|
311 |
+
|
312 |
+
.I 56
|
313 |
+
.W
|
314 |
+
The standard method of finding information in today's libraries is
|
315 |
+
through the use of the alphabetically arranged card catalog or the
|
316 |
+
classified catalog based on a classification system such as the DC or
|
317 |
+
LC. Can these systems be modified for use with automated information
|
318 |
+
retrieval?
|
319 |
+
|
320 |
+
.I 57
|
321 |
+
.W
|
322 |
+
In catalogs which are either arranged alphabetically or arranged by
|
323 |
+
classification number, the LC entry, printed in readable language, is
|
324 |
+
ultimately important because the individual looking for information
|
325 |
+
has a definite author, title, or subject phrase in his language
|
326 |
+
(probably English in our case) in mind. Will LC entries and subject
|
327 |
+
headings be used in the same manner in automated systems?
|
328 |
+
|
329 |
+
|
330 |
+
|
331 |
+
.I 58
|
332 |
+
.T
|
333 |
+
Directions in Library Networking
|
334 |
+
.A
|
335 |
+
Avram, H.D.
|
336 |
+
McCallum, S.H.
|
337 |
+
.W
|
338 |
+
Bibliographic control before and after MARC is reviewed. The capability
|
339 |
+
of keying into online systems brought an interdependence among libraries,
|
340 |
+
the service centers that mediate between them, and the large utilities that
|
341 |
+
process and distribute data. From this has developed the basic network
|
342 |
+
structure among libraries in the United States. The independent development
|
343 |
+
of major networks has brought problems in standardization and coordination.
|
344 |
+
The authors point out that while technology has led toward centralization
|
345 |
+
of automated library services, new developments are now pushing toward
|
346 |
+
decentralization. Coordination is a requirement to avoid fragmentation in
|
347 |
+
this new environment.
|
348 |
+
.B
|
349 |
+
(JASIS, Vol. 31, No. 6, November 1980, pp. 438-444)
|
350 |
+
|
351 |
+
.I 59
|
352 |
+
.T
|
353 |
+
Performance Testing of a Book and Its Index as a Information Retrieval
|
354 |
+
System
|
355 |
+
.A
|
356 |
+
Bennion, B.C.
|
357 |
+
.W
|
358 |
+
The retrieval performance of book indexes can be measured in terms of
|
359 |
+
their ability to direct a user selectively to text material whose identity
|
360 |
+
but not location is known. The method requires human searchers to base
|
361 |
+
their searching strategies on actual passages from the book rather than on
|
362 |
+
test queries, natural or contrived. It circumvents the need for relevance
|
363 |
+
judgement, but still yields performance indicators that correspond
|
364 |
+
approximately to the recall and precision ratios of large document retrieval
|
365 |
+
system evaluation. A preliminary application of the method to the subject
|
366 |
+
indexing of two major encyclopedias showed one encyclopedia apparently
|
367 |
+
superior in both the finding and discrimination abilities of retrieval
|
368 |
+
performance. The method is presently best suited for comparative testing
|
369 |
+
since its ability to yield absolute or reproducible measures is as yet not
|
370 |
+
established.
|
371 |
+
.B
|
372 |
+
(JASIS, Vol. 31, No. 4, July 1980, pp. 264-270)
|
373 |
+
|
374 |
+
.I 60
|
375 |
+
.T
|
376 |
+
The Combined Use of Bibliographic Coupling and Cocitation for Document
|
377 |
+
Retrieval
|
378 |
+
.A
|
379 |
+
Bichteler, J.
|
380 |
+
Eaton, E.A. III
|
381 |
+
.W
|
382 |
+
A linkage similarity measure which takes into account both the bibliographic
|
383 |
+
coupling of documents and their cocitations (both cited and citing papers)
|
384 |
+
produced improved document retrieval over a measure based only on
|
385 |
+
bibliographic coupling. The test collection consisted of 1712 papers whose
|
386 |
+
relevance to specific queries had been judged by users. To evaluate the
|
387 |
+
effect of using cocitation data, we calculated for each query two measures
|
388 |
+
of similarity between each relevant paper and every other paper retrieved.
|
389 |
+
Papers were then sorted by the similarity measures, producing two ordered
|
390 |
+
lists. We then compared the resulting predictions of relevance, partial
|
391 |
+
relevance, and non-relevance to the user's evaluations of the same papers.
|
392 |
+
Overall, the change from the bibliographic coupling measure to the linkage
|
393 |
+
similarity measure, representing the introduction of cocitation data,
|
394 |
+
resulted in better retrieval performance.
|
395 |
+
.B
|
396 |
+
(JASIS, Vol. 31, No. 4, July 1980, pp. 278-282)
|
397 |
+
|
398 |
+
.I 61
|
399 |
+
.T
|
400 |
+
Searching Biases in Large Interactive Document Retrieval Systems
|
401 |
+
.A
|
402 |
+
Blair, D.C.
|
403 |
+
.W
|
404 |
+
The way that individuals construct and modify search queries on a
|
405 |
+
large interactive document retrieval system is subject to systematic biases
|
406 |
+
similar to those that have been demonstrated in experiments on judgements
|
407 |
+
under uncertainty. These biases are shared by both naive and sophisticated
|
408 |
+
subjects and cause the inquirer searching for documents on a large interactive
|
409 |
+
system to construct and modify queries inefficiently. A searching algorithm
|
410 |
+
is suggested that helps the inquirer to avoid the effect of these biases.
|
411 |
+
.B
|
412 |
+
(JASIS, Vol. 31, No. 4, July 1980, pp. 271-277)
|
413 |
+
|
414 |
+
.I 62
|
415 |
+
.T
|
416 |
+
Fuzzy Requests: An Approach to Weighted Boolean Searches
|
417 |
+
.A
|
418 |
+
Bookstein, A.
|
419 |
+
.W
|
420 |
+
This article concerns the problem of how to permit a patron to
|
421 |
+
represent the relative importance of various index terms in a Boolean
|
422 |
+
request while retaining the desirable properties of a Boolean system.
|
423 |
+
The character of classical Boolean systems is reviewed and related to the
|
424 |
+
notion of fuzzy sets. The fuzzy set concept then forms the basis of the
|
425 |
+
concept of a fuzzy request in which weights are assigned to index terms.
|
426 |
+
Ther properties of such a system are discussed, and it is shown that such
|
427 |
+
systems retain the manipulability of traditional Boolean requests.
|
428 |
+
.B
|
429 |
+
(JASIS, Vol. 31, No. 4, July 1980, pp. 240-247)
|
430 |
+
|
431 |
+
.I 63
|
432 |
+
.T
|
433 |
+
Feature Comparison of an In-House Information Retrieval System With a
|
434 |
+
Commercial Search Service
|
435 |
+
.A
|
436 |
+
Boyle, S.O.
|
437 |
+
Miller, A.P.
|
438 |
+
.W
|
439 |
+
A commercially available online search was used as a standard for
|
440 |
+
comparative searching and evaluation of an in-house information system
|
441 |
+
based on automatic indexing. System features were identified and
|
442 |
+
evaluated on the basis of their usefulness in various kinds of searching,
|
443 |
+
their ease in implementation, and how they are influenced by differences
|
444 |
+
in user type or specific applications. Some common features of the
|
445 |
+
commercial system, such as online instruction, user-specified print formats,
|
446 |
+
dictionary display, and truncation, are seen to be unnecessary or
|
447 |
+
impractical for the in-house system. In designing the in-house system,
|
448 |
+
therefore, detald consideration must be given to the applications,
|
449 |
+
operating environment, and real user needs. While a commercial system can
|
450 |
+
serve as a useful standard for comparative evaluation, one must be
|
451 |
+
careful not to attempt to duplicate it blindly in-house.
|
452 |
+
.B
|
453 |
+
(JASIS, Vol. 31, No. 5, September 1980, pp. 309-317)
|
454 |
+
|
455 |
+
.I 64
|
456 |
+
.T
|
457 |
+
Measurement in Information Science: Objective and Subjective Metrical Space
|
458 |
+
.A
|
459 |
+
Brookes, B.C.
|
460 |
+
.W
|
461 |
+
It is argued that in information science we have to distinguish
|
462 |
+
physical, objective, or document space from perspective, subjective, or
|
463 |
+
information space. These two spaces are like maps and landscapes: each
|
464 |
+
is a systematic distortion of the other. However, transformation can be
|
465 |
+
easily made once the two spaces are distinguished. If the transformations
|
466 |
+
are omitted we only get unhelpful physical solutions to information problems.
|
467 |
+
.B
|
468 |
+
(JASIS, Vol. 31, No. 4, July 1980, pp. 248-255)
|
469 |
+
|
470 |
+
.I 65
|
471 |
+
.T
|
472 |
+
A Model of Cluster Searching Based on Classification
|
473 |
+
.A
|
474 |
+
Croft, W.B.
|
475 |
+
.W
|
476 |
+
The use of document clusters has been suggested as an efficient file
|
477 |
+
organization for a document retrieval system. It is possible that by
|
478 |
+
using this information about the relationships between documents that the
|
479 |
+
effectiveness of the system (i.e., its ability to distinguish relevant
|
480 |
+
from non-relevant documents) may also be improved. In this paper a
|
481 |
+
probabilistic model of cluster searching based on query classification is
|
482 |
+
described. This model is tested with retrieval experiments which indicate
|
483 |
+
that it can be more effective than heuristic cluster searches and cluster
|
484 |
+
searches based on other models. It can also be more effective than a full
|
485 |
+
search in which every document is compared to the query. The efficiency
|
486 |
+
aspects of the implementation of the model are discussed.
|
487 |
+
.B
|
488 |
+
(Inform. Systems, Vol. 5, No. 3, 1980, pp. 189-195)
|
489 |
+
|
490 |
+
.I 66
|
491 |
+
.T
|
492 |
+
The Technology of Library and Information Networks
|
493 |
+
.A
|
494 |
+
Epstein, H.
|
495 |
+
.W
|
496 |
+
Current online library network technology is described, including the
|
497 |
+
physical and functional aspects of networks. Three types of networks are
|
498 |
+
distinguished: search service (e.g., SDC, Lockheed), customized service
|
499 |
+
that provide bibliographic files (e.g., OCLC, Inc., RLIN), and service
|
500 |
+
center (e.g., NELINET, INCOLSA). It is predicted that as technology
|
501 |
+
evolves more services will be provided outside the library directly to the
|
502 |
+
user through his home or office.
|
503 |
+
.B
|
504 |
+
(JASIS, Vol. 31, No. 6, November 1980, pp. 425-437)
|
505 |
+
|
506 |
+
.I 67
|
507 |
+
.T
|
508 |
+
The Use of Titles for Automatic Document Classification
|
509 |
+
.A
|
510 |
+
Hamill, K.A.
|
511 |
+
Zamora, A.
|
512 |
+
.W
|
513 |
+
An experimental computer program has been developed to classify
|
514 |
+
documents according to the 80 sections and five major section groupings of
|
515 |
+
Chemical Abstracts (CA). The program uses pattern recognition techniques
|
516 |
+
supplemented by heuristics. During the "training" phase, words from
|
517 |
+
pre-classified documents are selected, and the probability of occurrence
|
518 |
+
of each word in each section of CA is computed and stored in a reference
|
519 |
+
dictionary. The "classification" phase matches each word of a document
|
520 |
+
title against the dictionary and assigns a section number to the document
|
521 |
+
using weights derived from the probabilities in the dictionary. Heuristic
|
522 |
+
techniques are used to normalize word variants such as plurals, past
|
523 |
+
tenses, and gerunds in both the training phase and the classification
|
524 |
+
phase. The dictionary lookup technique is supplemented by the analysis of
|
525 |
+
chemical nomenclature terms into their component word roots to influence
|
526 |
+
the section to which the documents are assigned. Program performance and
|
527 |
+
human consistency have been evaluated by comparing the program results
|
528 |
+
against the published sections of CA and by conducting an experiment with
|
529 |
+
people experienced in the assignment of documents to CA sections. The
|
530 |
+
program assigned approximately 78% of the documents to the correct major
|
531 |
+
section groupings of CA and 67% of the correct sections or cross-references
|
532 |
+
at a rate of 100 documents per second.
|
533 |
+
.B
|
534 |
+
(JASIS, Vol. 31, No. 6, November 1980, pp. 396-402)
|
535 |
+
|
536 |
+
.I 68
|
537 |
+
.T
|
538 |
+
Brief Communications
|
539 |
+
.A
|
540 |
+
Harding, A.G.
|
541 |
+
Willett, P.
|
542 |
+
.W
|
543 |
+
Some of the automatic classification procedures used in information
|
544 |
+
retrieval derive clusters of documents from an intermediate similarity
|
545 |
+
matrix, the computation of which involves comparing each of the documents
|
546 |
+
in the collection with all of the others. It has recently been suggested
|
547 |
+
that many of these comparisons, specifically those between documents
|
548 |
+
having no terms in common, may be avoided by means of the uyse of an inverted
|
549 |
+
file to the document collection. This communication shows that the
|
550 |
+
approach will effect reductions in the number of interdocument comparisons
|
551 |
+
only if the documents are each indexed by a limited number of indexing
|
552 |
+
terms; if exhaustive indexing is used, many document pairs will be compared
|
553 |
+
several times over and the computation will be greater than when
|
554 |
+
conventional approaches are used to generate the similarity matrix.
|
555 |
+
.B
|
556 |
+
(JASIS, Vol. 31, No. 4, July 1980, pp. 298-299)
|
557 |
+
|
558 |
+
.I 69
|
559 |
+
.T
|
560 |
+
The Application of a Minicomputer to Thesaurus Construction
|
561 |
+
.A
|
562 |
+
Kazlauskas, E.J.
|
563 |
+
Holt, T.D.
|
564 |
+
.W
|
565 |
+
The Use of a minicomputer in various phases of creating the thesaurus
|
566 |
+
for the National Information Center for Special Education Materials
|
567 |
+
(NICSEM) database is described. The minicomputer is used to collect,
|
568 |
+
edit, and correct candidate thesaurus terms. The use of the minicomputer
|
569 |
+
eases the process of grouping terms into files of similar concepts and
|
570 |
+
facilitates the generation of products useful in vocabulary review and in
|
571 |
+
term structuring. Syndetic relations, indicated by assigning coded
|
572 |
+
identification numbers, are altered easily in the design phase to reflect
|
573 |
+
restructuring requirements. Because thesaurus terms are already in machine-
|
574 |
+
readable form, it is simple to prepare print programs to provide permuted,
|
575 |
+
alphabetic, hierarchical, and chart formatted term displays. Overall, the
|
576 |
+
use of the minicomputer facilitates initial thesaurus entry development by
|
577 |
+
reducing clerical effort, editorial staff decisions, and overall processing
|
578 |
+
times.
|
579 |
+
.B
|
580 |
+
(JASIS, Vol. 31, No. 5, September 1980, pp. 363-368)
|
581 |
+
|
582 |
+
.I 70
|
583 |
+
.T
|
584 |
+
Adaptive Design for Decision Support Systems
|
585 |
+
.A
|
586 |
+
Keen, P.G.W.
|
587 |
+
.W
|
588 |
+
Decision Support Systems (DSS) represent a concept of the role of
|
589 |
+
computers within the decision making process. The term has become a
|
590 |
+
rallying cry for researchers, practitioners, and managers concerned that
|
591 |
+
Management Science and Management Information Systems fields have become
|
592 |
+
unnecessarily narrow in focus. As with many rallying cries, the term is
|
593 |
+
not well defined. For some writers, DSS simply mean interactive systems
|
594 |
+
for use by managers. To others, the key issue is support, rather than
|
595 |
+
system. They focus on understanding and improving the decision process;
|
596 |
+
a DSS is then designed using any available and suitable technology. Some
|
597 |
+
researchers view DSS as a subfield of MIS, while others regard it as an
|
598 |
+
extension of Management Science techniques. The former define Decision
|
599 |
+
Support as providing managers with access to data and the latter as giving
|
600 |
+
them access to analytic models.
|
601 |
+
|
602 |
+
The key argument of this paper is that the term DSS is relevant to
|
603 |
+
situations where a "final" system can be developed only through an
|
604 |
+
adaptive process of learning and evolution. The design strategy must
|
605 |
+
then focus on getting finished; this is very different from Management
|
606 |
+
Science and Data Processing approaches. The research issued for DSS
|
607 |
+
center around adaption and evolution; they include managerial learning
|
608 |
+
representation of tasks and user behavior, design architecture and
|
609 |
+
strategies for getting started.
|
610 |
+
.B
|
611 |
+
(Database, Vol. 12, No. 1-2, Fall 1980)
|
612 |
+
|
613 |
+
.I 71
|
614 |
+
.T
|
615 |
+
An Automatic Method for Extracting Significant
|
616 |
+
Phrases in Scienfific or Technical Documents
|
617 |
+
.A
|
618 |
+
Maeda, T.
|
619 |
+
Momouchi, J.
|
620 |
+
Sawamura, H.
|
621 |
+
.W
|
622 |
+
A new method is described to extract significant phrases in the title
|
623 |
+
and the abstreact of scientific or technical documents. The method is
|
624 |
+
based upon a text structure analysis and uses a relatively small dictionary.
|
625 |
+
The dictionary has been constructed based on the knowledge about concepts
|
626 |
+
in the field of science or technology and some lexical knowledge. For
|
627 |
+
significant phrases and their component items may be used in different
|
628 |
+
meanings among the fields. A text analysius approach has been applied to
|
629 |
+
select significant phrases as substantial and semantic information carriers
|
630 |
+
of the contents of the abstract.
|
631 |
+
|
632 |
+
The results of the experiment for five sets of documents have shown
|
633 |
+
that the significant phrases are effectively extracted in all cases, and
|
634 |
+
the number of them for every document and the processing time is fairly
|
635 |
+
satisfactory. The information representation of the document, partly
|
636 |
+
using the method, is discussed with relation to the construction of the
|
637 |
+
document information retrieval system.
|
638 |
+
.B
|
639 |
+
(Info. Proc. & Management, Vol. 16, No. 3, 1980, pp.119-127)
|
640 |
+
|
641 |
+
.I 72
|
642 |
+
.T
|
643 |
+
Answer-Passage Retrieval by Text Searching
|
644 |
+
.A
|
645 |
+
O'Connor, J.
|
646 |
+
.W
|
647 |
+
Passage retrieval (already operational for lawyers) has advantages in
|
648 |
+
output form opver references retrieval and is economically feasible.
|
649 |
+
Previous experiments in passage retrieval for scientists have demonstrated
|
650 |
+
recall and false retrieval rates as good or better than those of present
|
651 |
+
reference retrieval services. The present experiment involved a greater
|
652 |
+
variety of forms of retrieval question. In addition, search words were
|
653 |
+
selected independently by two different people for each retrieval question.
|
654 |
+
The search words selected, in combination with the computer procedures used
|
655 |
+
for passage retrieval, produced average recall ratios of 72 and 67%,
|
656 |
+
respectively, for the two selectors. The false retrieval rates were (except
|
657 |
+
for one predictably difficult question) respectively 13 and 10 falsely
|
658 |
+
retrieved sentences per answer-paper retrieved.
|
659 |
+
.B
|
660 |
+
(JASIS, Vol. 31, No. 4, July 1980, pp. 227-239)
|
661 |
+
|
662 |
+
.I 73
|
663 |
+
.T
|
664 |
+
Partial-Match Retrieval Using Indexed Descriptor Files
|
665 |
+
.A
|
666 |
+
Pfaltz, J.L.
|
667 |
+
Berman, W.J.
|
668 |
+
Cagley, E.M.
|
669 |
+
.W
|
670 |
+
In this paper we describe a practical method of partial-match retrieval
|
671 |
+
in very large data files. A binary code word, called a descriptor, is
|
672 |
+
associated with each record of the file. These record descriptors are
|
673 |
+
then used to form a derived descriptor for a block of several records,
|
674 |
+
which will serve as an index for the block as a whole; hence, the name
|
675 |
+
"indexed descriptor files."
|
676 |
+
|
677 |
+
First the structure of these files is described and a simple, efficient
|
678 |
+
retrieval algorithm is presented. Then its expected behavior, in terms of
|
679 |
+
storage accesses, is analyzed in detail. Two different file creation
|
680 |
+
procedures are sketched, and a number of ways in which the file organization
|
681 |
+
can be "tuned" to a particular application is suggested.
|
682 |
+
.B
|
683 |
+
(Commun. ACM, Vol. 23, No. 9, September 1980, pp. 522-528)
|
684 |
+
|
685 |
+
.I 74
|
686 |
+
.T
|
687 |
+
Cooperation and Competition Among Library Networks
|
688 |
+
.A
|
689 |
+
Robinson, B.M.
|
690 |
+
.W
|
691 |
+
Recenty technological advances and the success of OCLC, Inc. has led
|
692 |
+
to the emergence of three additional nonprofit library networks: the
|
693 |
+
Research Libraries Information Network (RLIN) of the Research Libraries
|
694 |
+
Group, Inc., the University of Toronto Library Automation System (UTLAS),
|
695 |
+
and the Washington Library Network (WLN). This paper examines the economic
|
696 |
+
and technological factors affecting the evolution of these networks and
|
697 |
+
also explores the role of those state and regional (multistate) networks
|
698 |
+
that broker OCLC services. The competitive and cooperative nature of
|
699 |
+
network relationships is a major theme of the discussion.
|
700 |
+
.B
|
701 |
+
(JASIS, Vol. 31, No. 6, November 1980, pp. 413-424)
|
702 |
+
|
703 |
+
.I 75
|
704 |
+
.T
|
705 |
+
An Integrated Understander
|
706 |
+
.A
|
707 |
+
Schank, R.C.
|
708 |
+
Lebowitz, M.
|
709 |
+
Birnbarim, L.
|
710 |
+
.W
|
711 |
+
A new type of natural language parser is presented. The idea behind
|
712 |
+
this parser is to map input sentences into the deepest form of the
|
713 |
+
representation of their meaning and inferences, as is appropriate. The
|
714 |
+
parser is not distinct from an entire understanding system. It uses an
|
715 |
+
integrated conception of inferences, scripts, plans and other knowledge to
|
716 |
+
aid in the parse. Furthermore, it does not attempt to parse everything it
|
717 |
+
sees. Rather, it determines what is most interesting and concentrates on
|
718 |
+
that, ignoring the rest.
|
719 |
+
.B
|
720 |
+
(Am. J. of Computational Linguistics, Vol. 6, No. 1, January-March 1980,
|
721 |
+
pp. 13-30)
|
722 |
+
|
723 |
+
.I 76
|
724 |
+
.T
|
725 |
+
Library Networks and Resource Sharing in the United States:
|
726 |
+
An Historical and Philosophical Overview
|
727 |
+
.A
|
728 |
+
Stevens, N.D.
|
729 |
+
.W
|
730 |
+
This paper discusses the origins of library networks and traces their
|
731 |
+
development in the United States in the late 1960s through the present.
|
732 |
+
The concept of resource sharing, with particular attention to the inter-
|
733 |
+
library loan and programs for the cooperative acquisition and storage of
|
734 |
+
materials, is examined in relationship to library networks. In particular,
|
735 |
+
attention is given to the question of how these two major components of
|
736 |
+
library cooperation, which have tended to be separate, might become more
|
737 |
+
closely integrated.
|
738 |
+
.B
|
739 |
+
(JASIS, Vol. 31, No. 6, November 1980, pp. 405-412)
|
740 |
+
|
741 |
+
.I 77
|
742 |
+
.T
|
743 |
+
Normalization of Titles and Their Retrieval
|
744 |
+
.A
|
745 |
+
Takamatsu, S.
|
746 |
+
Fujita, UY.
|
747 |
+
Nishida, F.
|
748 |
+
.W
|
749 |
+
This paper presents a method of normalizations of English titles and
|
750 |
+
their retrieval. The title expressed by a noun phrase or a noun clause
|
751 |
+
is converted to a function-expression by parsing. For the retrieval with
|
752 |
+
a reasonable recall rate as well as a high precision rate, the function-
|
753 |
+
expression is transformed to a predicate-governor form, and then normalized
|
754 |
+
to a standard form. Therefrom, various items are extracted and recorded
|
755 |
+
in a hierarchical tree-like inverted file.
|
756 |
+
|
757 |
+
In order to keep the recall rate in a reasonable value, several
|
758 |
+
retrieval stages are implemented based on the key-term and case-label
|
759 |
+
matching. The retrieval is controlled by the preciseness of the specification
|
760 |
+
of case-labels for each key-term.
|
761 |
+
.B
|
762 |
+
(Info. Proc. & Management, Vol. 16, No. 3, 1980, pp. 155-167)
|
763 |
+
|
764 |
+
.I 78
|
765 |
+
.T
|
766 |
+
Cascaded ATN Grammars
|
767 |
+
.A
|
768 |
+
Woods, W.A.
|
769 |
+
.W
|
770 |
+
A generalization of the notion of ATN grammar, called a cascaded ATN
|
771 |
+
(CATN), is prescribed. CATN's permit a decomposition of complex language
|
772 |
+
understanding behavior into a sequence of cooperating ATN's with separate
|
773 |
+
domain of responsibility, where each stage (called an ATN transducer)
|
774 |
+
takes its input from the output of the previous stage. The paper includes
|
775 |
+
an extensive discjussion of the principles of factoring-conceptual
|
776 |
+
factoring reduces the number of places that a given fact needs to be
|
777 |
+
represented in a grammar, and hypothesis factoring reduces the number
|
778 |
+
of distinct hypotheses that have to be considered during parsing.
|
779 |
+
.B
|
780 |
+
(Am. of Computational Linguistics, Vol. 6, No. 1, January-March 1980)
|
781 |
+
|
782 |
+
.I 79
|
783 |
+
.T
|
784 |
+
Algorithms for Processing Partial Match Queries Using Word Fragments
|
785 |
+
.A
|
786 |
+
Alagar, V.S.
|
787 |
+
.W
|
788 |
+
Algorithms are given to process partially specified queries in a
|
789 |
+
compressed database system. The proposed methods handle effectively
|
790 |
+
queries that use either whole words or word fragments as language elements.
|
791 |
+
The methods are compared and critically evaluated in terms of the design
|
792 |
+
and retrieval costs. The analyses show that the method which exploits the
|
793 |
+
interdependence of fragments as well as the relevance of fragments to
|
794 |
+
records in the file has maximum design cost and least retrieval cost.
|
795 |
+
.B
|
796 |
+
(Inform. Systems, Vol. 5, No. 4, April 1980, pp. 323-332)
|
797 |
+
|
798 |
+
.I 80
|
799 |
+
.T
|
800 |
+
A General Formulation of Bradford's Distribution: The Graph-Oriented
|
801 |
+
Approach
|
802 |
+
.A
|
803 |
+
Asai, I.
|
804 |
+
.W
|
805 |
+
From the detailed analysis of eight previously published mathematical
|
806 |
+
models, a general formulation of Bradford's distribution can be deduced as
|
807 |
+
follows: y = a log(x + c) + b, where y is the ratio of the cumulative
|
808 |
+
frequency of articles to the total number of articles and x is the ratio
|
809 |
+
of the rank of journals to the total number of journals. The parameters a, b,
|
810 |
+
and c are the slope, the intercept, and the shift in a straight line to log rank,
|
811 |
+
respectively. Each of the eight models is a special case of the general
|
812 |
+
formulation and is one of five types of formulation. In order to estimate
|
813 |
+
three unknown parameters, a statistical method using root-weighted square
|
814 |
+
error is proposed. A comparative experiment using 11 databases suggests that
|
815 |
+
the fifth type of formulation with three unknown parameters is the best fit
|
816 |
+
to the observed data. A further experiment shows that the deletion of the
|
817 |
+
droop data leads to a more accurate value of parameters and less error.
|
818 |
+
.B
|
819 |
+
(JASIS, Vol. 32, No. 2, March 1981, pp. 113-121)
|
820 |
+
|
821 |
+
.I 81
|
822 |
+
.T
|
823 |
+
Lexical Problems in Large Distributed Information Systems
|
824 |
+
.A
|
825 |
+
Berkovich, S.Y.
|
826 |
+
Shneiderman, B.
|
827 |
+
.W
|
828 |
+
The lexical problems in large information systems are created by the
|
829 |
+
necessity of handling a great number of names and their interrelations.
|
830 |
+
Such lexical problems are not covered completely by the concept data
|
831 |
+
dictionaries, which are mostly concerned with database scheme design rather
|
832 |
+
than the execution of operations. In this paper we introduce our view of a
|
833 |
+
lexical subsystem as a separate component in an information system architecture,
|
834 |
+
to deal with linguistic and control functions concerning the lexical problems
|
835 |
+
in local and network environments. The lexical suybsystem is a special
|
836 |
+
efficiently organized program package, which plays the role of a "linguistic
|
837 |
+
filter" in a broad sense for lexically incorrect queries, promotes integration
|
838 |
+
of databases and information retrieval systems, and facilitates the creation
|
839 |
+
of local information systems. We hope that lexical subsystems can become
|
840 |
+
productive for any large, especially distributed, information system.
|
841 |
+
.B
|
842 |
+
(Information Processing & Management, Vol. 16, February 1980, pp. 259-267)
|
843 |
+
|
844 |
+
.I 82
|
845 |
+
.T
|
846 |
+
The Relational Model in Information Retrieval
|
847 |
+
.A
|
848 |
+
Crawford, R.G.
|
849 |
+
.W
|
850 |
+
The relational model has received increasing attention during the
|
851 |
+
past decade. Its advantages include simplicity, consistency, and a sound
|
852 |
+
theoretical basis. In this article, the naturalness of viewing information
|
853 |
+
retrieval relationally is demonstrated. The relational model is presented,
|
854 |
+
and the relational organization of a bibliographical database is shown.
|
855 |
+
The notion of normalization is introduced and first, second, third, and
|
856 |
+
fourth normal forms are demonstrated. Relational languages are discussed,
|
857 |
+
including the relational calculus, relational algebra, and SEQUEL.
|
858 |
+
Numerous examples pertinent to information retrieval are presented in these
|
859 |
+
relational languages. Advantages of the relational approach to information
|
860 |
+
retrieval are noted.
|
861 |
+
.B
|
862 |
+
(JASIS, Vol. 32, No. 1, January 1981, pp. 51-64)
|
863 |
+
|
864 |
+
.I 83
|
865 |
+
.T
|
866 |
+
Electronic Information Interchange in an Office Environment
|
867 |
+
.A
|
868 |
+
DeSousa, M.R.
|
869 |
+
.W
|
870 |
+
This paper describes an architectural approach that provides information
|
871 |
+
exchange across a broad spectrum of user applications and office automation
|
872 |
+
offerings. Some of the architectures described herein are currently
|
873 |
+
implemented in existing IBM products. These and other architectures will
|
874 |
+
provide the basis for document interchange capability between products
|
875 |
+
such as the IBM 5520 Administrative System, the IBM System/370 Distributed
|
876 |
+
Office Support System (DISOSS), and the IBM Displaywriter System.
|
877 |
+
Specifically described is a document distribution architecture and its
|
878 |
+
associated data streams and others.
|
879 |
+
|
880 |
+
A general overview of the architectures as opposed to a detailed
|
881 |
+
technical description is provided. The architectures described are
|
882 |
+
protocols for interchange between application processes; they do not
|
883 |
+
address the specific user interface. The document distribution
|
884 |
+
architectures utilize SNA for data transmission and communications control
|
885 |
+
facilities.
|
886 |
+
.B
|
887 |
+
(IBM Systems Journal, Vol. 20, No. 1, 1981, pp. 4-22)
|
888 |
+
|
889 |
+
.I 84
|
890 |
+
.T
|
891 |
+
The Use of Automatic Relevance Feedback in Boolean Retrieval Systems
|
892 |
+
.A
|
893 |
+
Dillon, M.
|
894 |
+
Desper, J.
|
895 |
+
.W
|
896 |
+
A technique is described for automatic reformulation of boolean
|
897 |
+
queries. Based on patron relevance judgements of an initial retrieval,
|
898 |
+
prevalence measures are derived for terms appearing in the retrieved set
|
899 |
+
of documents that reflect a term's distribution among the relevant and
|
900 |
+
non-relevant documents. These measures are then used to guide the
|
901 |
+
construction of a boolean query for a subsequent retrieval. To illustrate
|
902 |
+
the technique, a series of tests is described of its application to a small
|
903 |
+
data base in an experimental environment. Results compare favourably with
|
904 |
+
feedback as employed in a SMART-type system. MOre extensive testing is
|
905 |
+
suggested to validate the technique.
|
906 |
+
.B
|
907 |
+
(Journal of Documentation, Vol. 36, No. 3, September 1980, pp. 197-208)
|
908 |
+
|
909 |
+
.I 85
|
910 |
+
.T
|
911 |
+
Interacting in Natural Language With Artificial Systems: The Donau Project
|
912 |
+
.A
|
913 |
+
Guida, G.
|
914 |
+
Somalvico, M.
|
915 |
+
.W
|
916 |
+
This paper is intended to propose a new methodological approach to
|
917 |
+
the conception and development of natural language understanding systems.
|
918 |
+
This new contribution is supported by the design, implementation, and
|
919 |
+
experimentation of DONAU: a general purpose domain oriented natural
|
920 |
+
language understanding system developed and presently running at the Milan
|
921 |
+
Polytechnic Artificial Intelligence Project. The system is based on a two
|
922 |
+
level modular architecture intended to overcome the lack of flexibility and
|
923 |
+
generality often pointed out in many existing systems, and to facilitate
|
924 |
+
the exchange of results and actual experiences between different projects.
|
925 |
+
The horizontal level allows an independent and parallel development of the
|
926 |
+
single segments of the system (syntactic analyser, information extractor,
|
927 |
+
legality controller). The vertical level ensures the possibility of changing
|
928 |
+
(enlarging or redefining) the definition of the semantic domain on which each
|
929 |
+
particular version of the system is oriented and specialized in a simple,
|
930 |
+
incremental, and user-oriented way. In the paper the general architecture of
|
931 |
+
the system and the mode of operation of each segment are illustrated in
|
932 |
+
detail. Linguistic models, knowledge representation, and parsing algorithms
|
933 |
+
are described and illustrated by means of selected examples. Performance
|
934 |
+
evaluations of the system in the application version on data base inquiry are
|
935 |
+
reported and discussed. Promising directions for future research are presented
|
936 |
+
in the conclusions.
|
937 |
+
.B
|
938 |
+
(Inform. Systems, Vol. 5, NO. 4, February 1980, pp. 333-344)
|
939 |
+
|
940 |
+
.I 86
|
941 |
+
.T
|
942 |
+
Approximate String Matching
|
943 |
+
.A
|
944 |
+
Hall, P.A.V.
|
945 |
+
Dowling, G.R.
|
946 |
+
.W
|
947 |
+
Approximate matching of strings is reviewed with the aim of
|
948 |
+
surveying techniques suitable for finding an item in a database when
|
949 |
+
there may be a spelling mistake or other error in the keyword. The
|
950 |
+
methods found are classified as either equivalence or similarity problems.
|
951 |
+
Equivalence problems are seen to be readily solved using canonical forms.
|
952 |
+
For similarity problems difference measures are surveyed, with a full
|
953 |
+
description of the well-established dynamic programming method relating
|
954 |
+
this to the approach using probabilities and likelihoods. Searches for
|
955 |
+
approximate matches in large sets using a difference function are seen to
|
956 |
+
be an open problem still, though several promising ideas have been
|
957 |
+
suggested. Approximate matching (error correction) during parsing is
|
958 |
+
briefly reviewed.
|
959 |
+
.B
|
960 |
+
(Computing Surveys, Vol. 12, No. 4, December 1980, pp. 381-402)
|
961 |
+
|
962 |
+
.I 87
|
963 |
+
.T
|
964 |
+
Using an Online Microfiche Catalog for Technical Service and Retrieval of
|
965 |
+
Bibliographic Data
|
966 |
+
.A
|
967 |
+
Hayes, R.M.
|
968 |
+
Borko, H.
|
969 |
+
.W
|
970 |
+
A prototype system is created that integrates a microfiche catalog
|
971 |
+
into an online computer system for bibliographic control. Costs and
|
972 |
+
operational data are collected and analyzed. The system permits the more
|
973 |
+
economical microfiche storage of catalog records than would be feasible
|
974 |
+
for comparable online magnetic disk storage. Experimental tests
|
975 |
+
demonstrate the feasibility of the online microfiche catalog system for use
|
976 |
+
in library technical services and retrieval of bibliographic data. The
|
977 |
+
primary result of the project is the creation of a completely operational
|
978 |
+
facility, including all equipment, software, procedures, and data bases
|
979 |
+
necessary to demonstrate the system. A second set of results is derived
|
980 |
+
from the experimental use of the system and the evaluation of costs and
|
981 |
+
times for various operations. The cost effectiveness of the online microfiche
|
982 |
+
catalog is demonstrated.
|
983 |
+
.B
|
984 |
+
(Information Processing and Management, Vol. 16, No. 6, February 1980,
|
985 |
+
pp. 277-289)
|
986 |
+
|
987 |
+
.I 88
|
988 |
+
.T
|
989 |
+
Natural Language Access to Information Systems. An Evaluation Study
|
990 |
+
of Its Acceptance by End Users
|
991 |
+
.A
|
992 |
+
Krause, J.
|
993 |
+
.W
|
994 |
+
The question is asked whether it is feasible to use subsets of
|
995 |
+
natural languages as query languages for data bases in actual applications
|
996 |
+
using the question answering system "USER SPECIALTY LANGUAGES" (USL).
|
997 |
+
Methods of evaluating a natural language based information system will
|
998 |
+
be discussed. The results (error and language structure evaluation)
|
999 |
+
suggest how to form the general architecture of application systems which
|
1000 |
+
use a subset of German as query language.
|
1001 |
+
.B
|
1002 |
+
(Inform. Systems, Vol. 5, No. 4, May 1980, pp. 297-318)
|
1003 |
+
|
1004 |
+
.I 89
|
1005 |
+
.T
|
1006 |
+
Some Considerations Relating to the Cost-Effectiveness of Online Services
|
1007 |
+
in Libraries
|
1008 |
+
.A
|
1009 |
+
Lancaster, F.W.
|
1010 |
+
.W
|
1011 |
+
In 1978 Collier presented some hypothetical data on economic aspects
|
1012 |
+
of the use of online services as compared with subscriptions to printed
|
1013 |
+
services in libraries. Collier's view of the economics of online searching
|
1014 |
+
seems misleadingly pessimistic because:
|
1015 |
+
|
1016 |
+
1. It looks only at costs but not at effectiveness in comparing the two
|
1017 |
+
modes of access and searching. An analysis combining cost and
|
1018 |
+
effectiveness aspects (i.e., a cost-effectiveness analysis) would
|
1019 |
+
give a completely different picture.
|
1020 |
+
|
1021 |
+
2. The way the cost data are presented is grossly unfair to the online
|
1022 |
+
mode of access and use.
|
1023 |
+
|
1024 |
+
This work contains corrected information regarding online and printed
|
1025 |
+
services in libraries.
|
1026 |
+
.B
|
1027 |
+
(Aslib Proceedings, 33(1), January 1981, pp. 10-14, printed in Great Britain)
|
1028 |
+
|
1029 |
+
.I 90
|
1030 |
+
.T
|
1031 |
+
Co-Citation Context Analysis and the Structure of Paradigms
|
1032 |
+
.A
|
1033 |
+
Small, H.
|
1034 |
+
.W
|
1035 |
+
Many information scientists are concerned with the operation of
|
1036 |
+
document retrieval systems serving scientists in various fields. The
|
1037 |
+
scientists served by these systems are often members of what have been called
|
1038 |
+
invisible colleges, groups of scientists in frequent communication with
|
1039 |
+
one another and involved with highly specialized subject matters. Often
|
1040 |
+
such groups are considered to share an intellectual perspective regarding
|
1041 |
+
this subject matter, which is sometimes referred to as a paradigm.
|
1042 |
+
|
1043 |
+
The purpose of this paper is to show how it is possible to identify
|
1044 |
+
paradigms, using the techniques of citation analysis. I will operationalize
|
1045 |
+
the notion of paradigm as a 'consensual structure of concepts in a field.'
|
1046 |
+
Suppose we have obtained a set of papers pertaining to some topic. Already
|
1047 |
+
knowing something about the field, we read each text and mark passages in
|
1048 |
+
which certain specific concepts are used or discussed. For example, we
|
1049 |
+
might find that a concept designated 'A' appears in some sub-set of the
|
1050 |
+
papers. Suppose further that we identify those papers in which concepts 'A'
|
1051 |
+
and 'B' are used together in the same papers in a certain specified manner.
|
1052 |
+
Clearly not all concepts will combine in a natural way, and not all authors
|
1053 |
+
combining concepts 'A' and 'B' will do so in the same way, though some
|
1054 |
+
predominant mode may emerge. For a set of n concepts their structure is
|
1055 |
+
given by the totality of admissible combinations of concepts taken from
|
1056 |
+
two to n at a time. The frequency with which a given combination occurs
|
1057 |
+
in the sample of papers on the topic is a measure of the degree of consensus
|
1058 |
+
regarding the particular concept combination within the corpus. For
|
1059 |
+
concepts taken two at a time, the structure can be displayed as a graph with
|
1060 |
+
concepts as nodes and the relations between them represented as lines (arcs)
|
1061 |
+
connecting the nodes. This definition of concept structure is
|
1062 |
+
similar to the semantic network of artificial intelligence except that in
|
1063 |
+
our approach a measure of consensus weights each arc of the graph.
|
1064 |
+
.B
|
1065 |
+
(Journal of Documentation, Vol. 36, No. 3, September 1980, pp. 183-196)
|
1066 |
+
|
1067 |
+
.I 91
|
1068 |
+
.T
|
1069 |
+
Cocited Author Retrieval Online:
|
1070 |
+
An Experiment with the Social Indicators Literature
|
1071 |
+
.A
|
1072 |
+
White, H.D.
|
1073 |
+
.W
|
1074 |
+
One mode of online retrieval in Scisearch or Social Scisearch involves
|
1075 |
+
entering pairs of authors' names believed to be jointly cited by
|
1076 |
+
subsequent writers and retrieving papers in which cocitations occur. Six
|
1077 |
+
pairs were formed with the names of four authors prominent in the social
|
1078 |
+
indicators movement (Bauer, Duncan, Land, and Sheldon). Documents by the
|
1079 |
+
four were not specified. It was thought that the pair Duncan and Land
|
1080 |
+
would retrieve papers in which indicator-type data would be integrated with
|
1081 |
+
path-analytic causal modeling. All other pairs seemed likely to retrieve a
|
1082 |
+
"general social indicators" literature. The 298 retrieved papers confirmed
|
1083 |
+
expectattions. It was found that 121 papers generally cited social indicators
|
1084 |
+
(SI) documents by the input authors and frequently had SI language in
|
1085 |
+
their titles. Other signs of content also identified them as papers of
|
1086 |
+
the SI movement. The 177 papers retrieved on Duncan and Land generally
|
1087 |
+
cited causal modeling documents by the input pair and were path-analytic
|
1088 |
+
in nature. As expected, they were relatively "harder" than the first
|
1089 |
+
group of papers, although the two groups are akin and are formally linked
|
1090 |
+
through citations in certain papers. An additional result is that papers
|
1091 |
+
citing at least three of the input authors tend to be overviews of the SI
|
1092 |
+
movement.
|
1093 |
+
.B
|
1094 |
+
(JASIS, Vol. 32, No. 1, January 1981, pp. 16-21)
|
1095 |
+
|
1096 |
+
.I 92
|
1097 |
+
.T
|
1098 |
+
Database and Online Statistics for 1979
|
1099 |
+
.A
|
1100 |
+
Williams M.E.
|
1101 |
+
.W
|
1102 |
+
The number of databases, records contained in databases and the online
|
1103 |
+
use of databases has increased dramatically over the past several years,
|
1104 |
+
bringing the 1979 totals for bibliographic, bioliographic-related, and
|
1105 |
+
natural language databases to 528. These 528 databases contain 148 million
|
1106 |
+
records. Some 4 million online searches were conducted via the major U.S.
|
1107 |
+
and Canadian systems in 1979.
|
1108 |
+
.B
|
1109 |
+
(Bulletin of ASIS, Vol. 7, No. 2, December 1980, pp. 27-29)
|
1110 |
+
|
1111 |
+
.I 93
|
1112 |
+
.T
|
1113 |
+
Experiments in Local Metrical Feedback in Full-Text Retrieval Systems
|
1114 |
+
.A
|
1115 |
+
Attar, R.
|
1116 |
+
Fraenkel, A.S.
|
1117 |
+
.W
|
1118 |
+
A method of iterative searching, using the results of one iteration search
|
1119 |
+
to formulate the next iteration search, was applied to a full-text database
|
1120 |
+
consisting of some 2400 documents and 1,3000,000 text-words of Hebrew and
|
1121 |
+
Aramaic. The iterative method consists of clustering the documents returned
|
1122 |
+
in an iteration, using weighting by proximity and by frequency simultaneously.
|
1123 |
+
The process produces searchonyms, which are terms synonymous to keywords in the
|
1124 |
+
context of a single query. Augumenting or replacing keywords by searchonyms
|
1125 |
+
via manual or automatic feedback leads to the formulation of the next iteration
|
1126 |
+
search. The results of the experiment are consistent with those of an earlier
|
1127 |
+
small-scale experiment on an English database, and indicate that in contrast
|
1128 |
+
to global clustering where the size of matrices limits applications to small
|
1129 |
+
databases and improvements are doubtful, local metrical methods appear to be
|
1130 |
+
well suited to arbitrarily large databases, improving precision and recall
|
1131 |
+
simultaneously. Further experiments using more test-queries run on even
|
1132 |
+
larger databases should be made to collect further evidence as to the
|
1133 |
+
performance of these methods.
|
1134 |
+
.B
|
1135 |
+
(Information Processing & Management, Vol. 17, No. 3, 1981, pp. 115-126)
|
1136 |
+
|
1137 |
+
.I 94
|
1138 |
+
.T
|
1139 |
+
A Microcomputer Alternative for Information Handling: Refles
|
1140 |
+
.A
|
1141 |
+
Bivins, K.T.
|
1142 |
+
Palmer, R.C.
|
1143 |
+
.W
|
1144 |
+
REFLES is a microcomputer-based system for data retrieval in library
|
1145 |
+
environments. The problem of information retrieval is discussed from a
|
1146 |
+
theoretical point of view, followed by an analysis of the reference process
|
1147 |
+
and data thereby gathered, leading to a description of REFLES in terms of
|
1148 |
+
its hardware and software. REFLES, a prototype system at present, currently
|
1149 |
+
functions in a test environment. Examples of data contained in the system
|
1150 |
+
and of its use are presented. Future considerations and speculations on
|
1151 |
+
other versions of the system conclude the paper.
|
1152 |
+
.B
|
1153 |
+
(Information Processing & Management, Vol. 17, No. 2, 1981, pp. 93-101)
|
1154 |
+
|
1155 |
+
.I 95
|
1156 |
+
.T
|
1157 |
+
A Comparison of Two Systems of Weighted Boolean Retrieval
|
1158 |
+
.A
|
1159 |
+
Bookstein, A.
|
1160 |
+
.W
|
1161 |
+
A major deficiency of traditional Boolean systems is their inability to
|
1162 |
+
represent the varying degrees to which a document may be written on a subject.
|
1163 |
+
In this article we isolate a number of criteria that should be met by any
|
1164 |
+
Boolean system generalized to have a weighting capability. It is proven that
|
1165 |
+
only one weighting rule satisfies these conditions--that associated with fuzzy-
|
1166 |
+
set theory--and that this weighting scheme satisfies most of the other
|
1167 |
+
properties associated with Boolean algebra as well. Probabilistic weighting
|
1168 |
+
is then introduced as an alternative approach and the two systems compared.
|
1169 |
+
In the limit of zero/one weights, all systems considered converge to
|
1170 |
+
traditional Boolean retrieval.
|
1171 |
+
.B
|
1172 |
+
(JASIS, Vol. 32, No. 4, July 1981)
|
1173 |
+
|
1174 |
+
.I 96
|
1175 |
+
.T
|
1176 |
+
Threshold Values and Boolean Retrieval Systems
|
1177 |
+
.A
|
1178 |
+
Buell, D.A.
|
1179 |
+
Kraft, D.H.
|
1180 |
+
.W
|
1181 |
+
Several papers have appeared that have analyzed recent developments
|
1182 |
+
in the problem of processing, in a document retrieval system, queries expressed
|
1183 |
+
as Boolean expressions. The purpose of this paper is to continue that analysis.
|
1184 |
+
We shall show that the concept of threshold values resolves the problems
|
1185 |
+
inherent with relevance weights. Moreover, we shall explore possible evaluation
|
1186 |
+
mechanisms for retrieval of documents, based on fuzzy-set-theoretic
|
1187 |
+
considerations.
|
1188 |
+
.B
|
1189 |
+
(Information Processing & Management, Vol. 17, No. 3, 1981, pp. 127-136)
|
1190 |
+
|
1191 |
+
.I 97
|
1192 |
+
.T
|
1193 |
+
A Model for a Weighted Retrieval System
|
1194 |
+
.A
|
1195 |
+
Buell, D.A.
|
1196 |
+
Kraft, D.H.
|
1197 |
+
.W
|
1198 |
+
There has been a good deal of work on information retrieval systems that
|
1199 |
+
have continuous weights assigned to the index terms that describe the records
|
1200 |
+
in the database, and/or to the query terms that describe the user queries.
|
1201 |
+
Recent articles have analyzed retrieval systems with continuous weights of
|
1202 |
+
either type and/or with a Boolean structure for the queries. They have also
|
1203 |
+
suggested criteria which such systems ought to satisfy and record evaluation
|
1204 |
+
mechanisms which partially satisfy these criteria. We offer a more careful
|
1205 |
+
analysis, based on a generalization of the discrete weights. We also look
|
1206 |
+
at the weights from an entirely different approach involving thresholds, and
|
1207 |
+
we generate an improved evaluation mechanism which seems to fulfill a larger
|
1208 |
+
subset of the desired criteria than previous mechanisms. This new mechanism
|
1209 |
+
allows the user to attach a "threshold" to the query term.
|
1210 |
+
.B
|
1211 |
+
(JASIS, Vol. 32, No. 3, May 1981, pp. 211-216)
|
1212 |
+
|
1213 |
+
.I 98
|
1214 |
+
.T
|
1215 |
+
A Translating Computer Interface for End-User Operation of Heterogeneous
|
1216 |
+
Retrieval Systems. I. Design
|
1217 |
+
.A
|
1218 |
+
Marcus, R.S.
|
1219 |
+
Reintjes, J.F.
|
1220 |
+
.W
|
1221 |
+
Online retrieval systems may be difficult to use, especially by end
|
1222 |
+
users, because of heterogeneity and complexity. Investigations have concerned
|
1223 |
+
the concept of a translating computer interface as a means to simplify access
|
1224 |
+
to, and operation of, heterogeneous bibliographic retrieval systems and
|
1225 |
+
databases. The interface allows users to make requests in a common language.
|
1226 |
+
These requests are translated by the interface into the appropriate commands
|
1227 |
+
for whatever system is being interrogated. System responses may also be
|
1228 |
+
transformed by the interface into a common form before being given to the
|
1229 |
+
users. Thus, the network of different systems is made to look like a single
|
1230 |
+
"virtual" system to the user. The interface also provides instruction and
|
1231 |
+
other search aids for the user. The philosophy, design, and implementation
|
1232 |
+
of an experimental interface named CONIT are described.
|
1233 |
+
.B
|
1234 |
+
(JASIS, Vol. 32, No. 4, July 1981, pp. 287-303)
|
1235 |
+
|
1236 |
+
.I 99
|
1237 |
+
.T
|
1238 |
+
A Translating Computer Interface for End-User Operation of
|
1239 |
+
Heterogeneous Retrieval Systems. II. Evaluations
|
1240 |
+
.A
|
1241 |
+
Marcus, R.S.
|
1242 |
+
Reintjes, J.F.
|
1243 |
+
.W
|
1244 |
+
The evaluation of the concept of a translating compuyter interface for
|
1245 |
+
simplifying operation of multiple, heterogenous online bibliographic
|
1246 |
+
retrieval systems has been undertaken. An experimental retrieval system,
|
1247 |
+
named CONIT, was built and tested under controlled conditions with
|
1248 |
+
inexperienced end users. A detailed analysis of the experimental usages
|
1249 |
+
showed that users were able to master interface operation sufficiently well
|
1250 |
+
to find relevant document references. Success was attributed, in part,
|
1251 |
+
to a simple command language, adequate online instruction, and a simplified
|
1252 |
+
natural-language, keyword/stem approach to searching. It is concluded that
|
1253 |
+
operational interfaces of the type studied can provide for increased usability
|
1254 |
+
of existing system in a cost effective manner, especially for searchers.
|
1255 |
+
Furthermore, more advanced interfaces based on improved instruction and
|
1256 |
+
automated search strategy techniques could further enhance retrieval
|
1257 |
+
effectiveness for a wide class of users.
|
1258 |
+
.B
|
1259 |
+
(JASIS, Vol. 32, No. 4, July 1981, pp. 304-317)
|
1260 |
+
|
1261 |
+
.I 100
|
1262 |
+
.T
|
1263 |
+
The Interface Between Computerized Retrieval Systems and Micrographic
|
1264 |
+
Retrieval Systems
|
1265 |
+
.A
|
1266 |
+
McMurdo, G.
|
1267 |
+
.W
|
1268 |
+
This paper notes the benefits accruing from interaction between computerized
|
1269 |
+
retrieval systems and micrographic retrieval systems. It reviews current state
|
1270 |
+
of automated micrographic retrieval technology. The conclusion is that with a
|
1271 |
+
combination of advances in communications technology, and sophisticated indexing
|
1272 |
+
input from libraries and information scientists, the new generation of automated
|
1273 |
+
micrographs devices may constitute the on-line document retrieval systems of the
|
1274 |
+
future.
|
1275 |
+
.B
|
1276 |
+
(Journal of Information Science I, 1980, pp. 345-349)
|
1277 |
+
|
1278 |
+
.I 101
|
1279 |
+
.T
|
1280 |
+
Parallel Computations in Information Retrieval
|
1281 |
+
.A
|
1282 |
+
Salton, G.
|
1283 |
+
Bergmark, D.
|
1284 |
+
.W
|
1285 |
+
Conventional information retrieval processes are largely based on data
|
1286 |
+
movement, pointer manipulations and integer arithmetic; more refined retrieval
|
1287 |
+
algorithms may in addition benefit from substantial computational power.
|
1288 |
+
|
1289 |
+
In the present study a number of parallel processing methods are described
|
1290 |
+
that serve to enhance retrieval services. In conventional retrieval
|
1291 |
+
environments parallel list processing and parallel search facilities are of
|
1292 |
+
greatest interest. In more advanced systems, the use of array processors
|
1293 |
+
also proves beneficial. Various information retrieval processes are examined
|
1294 |
+
and evidence is given to demonstrate the usefulness of parallel processing
|
1295 |
+
and fast computational facilities in information retrieval.
|
1296 |
+
.B
|
1297 |
+
(In Lecture Notes in Computer Science, No. III, W. Handler, Ed., Springer
|
1298 |
+
Verlag, Berlin-New York, 1981, pp. 328-342)
|
1299 |
+
|
1300 |
+
.I 102
|
1301 |
+
.T
|
1302 |
+
The Measurement of Term Importance in Automatic Indexing
|
1303 |
+
.A
|
1304 |
+
Salton, G.
|
1305 |
+
Wu, H.
|
1306 |
+
Yu, C.T.
|
1307 |
+
.W
|
1308 |
+
The frequency characteristics of terms in the documents of a collection
|
1309 |
+
have been used as indicators of term importance for content analysis and
|
1310 |
+
indexing purposes. In particular, very rare or very frequent terms are
|
1311 |
+
normally believed to be less effective than medium-frequency terms. Recently
|
1312 |
+
automatic indexing theories have been devised that use not only the term
|
1313 |
+
frequency characteristics but also the relevance properties of the terms.
|
1314 |
+
The major term-weighting theories are first briefly reviewed. The term
|
1315 |
+
precision and term utility weights that are based on the occurrence
|
1316 |
+
characteristics of the terms in the relevant, as opposed to the nonrelevant,
|
1317 |
+
documents of a collection are then introduced. Methods are suggested for
|
1318 |
+
estimating the relevance properties of the terms based on their overall
|
1319 |
+
occurrence characteristics in the collection. Finally, experimental
|
1320 |
+
evaluation results are shown comparing the weighting systems using the term
|
1321 |
+
relevance properties with the more conventional frequency-based methodologies.
|
1322 |
+
.B
|
1323 |
+
(JASIS, Vol. 32, No. 3, May 1981, pp. 175-186)
|
1324 |
+
|
1325 |
+
.I 103
|
1326 |
+
.T
|
1327 |
+
NDX-100: An Electronic Filing Machine for the Office of the Future
|
1328 |
+
.A
|
1329 |
+
Slonim, J.
|
1330 |
+
MacRae, L.J.
|
1331 |
+
Mennie, W.E.
|
1332 |
+
Diamond, N.
|
1333 |
+
.W
|
1334 |
+
This paper describes the design and implementation of an "electronic filing
|
1335 |
+
machine," a machine which is capable of storing large numbers of "unstructured"
|
1336 |
+
documents in such a way a particular document may be easily and quickly
|
1337 |
+
retrieved. A functional distributed architecture permits the implementation
|
1338 |
+
of the system in a mixture of hardware and software.
|
1339 |
+
.B
|
1340 |
+
(Computer, Vol. 14, No. 5, May 1981, pp. 24-36)
|
1341 |
+
|
1342 |
+
.I 104
|
1343 |
+
.T
|
1344 |
+
The Selection of Good Search Terms
|
1345 |
+
.A
|
1346 |
+
van Rijsbergen, C.J.
|
1347 |
+
Harper, D.J.
|
1348 |
+
Porter, M.F.
|
1349 |
+
.W
|
1350 |
+
This paper tackles the problem of how one might select further search terms,
|
1351 |
+
using relevance feedback, given the search terms in the query. These search
|
1352 |
+
terms are extracted from a maximum spanning tree connecting all the terms in the
|
1353 |
+
index term vocabulary. A number of different spanning trees are generated from
|
1354 |
+
a variety of association measures. The retrieval effectiveness for the
|
1355 |
+
different spanning trees is shown to be approximately the same. Effectiveness
|
1356 |
+
is measured in terms of precision and recall, and the retrieval tests are done
|
1357 |
+
on three different test collections.
|
1358 |
+
.B
|
1359 |
+
(Information Processing & Management, Vol. 17, No. 2, 1981, pp. 77-91)
|
1360 |
+
|
1361 |
+
.I 105
|
1362 |
+
.T
|
1363 |
+
Indexing Consistency, Quality and Efficiency
|
1364 |
+
.A
|
1365 |
+
Rolling, L.
|
1366 |
+
.W
|
1367 |
+
Indexing quality determines whether the information content of an indexed
|
1368 |
+
document is accurately represented. Indexing effectiveness measures whether
|
1369 |
+
an indexed document is correctly retrieved every time it is relevant to a
|
1370 |
+
query. Measurement of these criteria is cumbersome and costly; data base
|
1371 |
+
producers therefore prefer inter-indexer consistency as a measure of indexing
|
1372 |
+
quality or effectiveness. The present article assesses the validity of this
|
1373 |
+
substitution in various environments.
|
1374 |
+
.B
|
1375 |
+
(Information Processing & Management, Vol. 17, No. 2, 1981, pp. 69-76)
|
1376 |
+
|
1377 |
+
.I 106
|
1378 |
+
.T
|
1379 |
+
Text Passage Retrieval Based on Colon Classification: Retrieval Performance
|
1380 |
+
.A
|
1381 |
+
Shepherd, M.A.
|
1382 |
+
.W
|
1383 |
+
A set of experiments was conducted to determine the suitability of the
|
1384 |
+
Colon Classification as a foundation for the automated analysis, representation
|
1385 |
+
and retrieval of primary information from the full text of documents. Primary
|
1386 |
+
information is that information embodied in the text of a document, as opposed
|
1387 |
+
to secondary information which is generally in such forms as: an abstract, a
|
1388 |
+
table of contents, or an index.
|
1389 |
+
Full text databases were created in two subject areas and queries solicited
|
1390 |
+
from specialists in each area. An automated full text indexing system, along
|
1391 |
+
with four automated passage retrieval systems, was created to test the various
|
1392 |
+
features of the Colon Classification. Two Boolean-based systems and one simple
|
1393 |
+
word occurrence system were created in order to compare the retrieval results
|
1394 |
+
against types of systems which are in more common use. The systems' retrieval
|
1395 |
+
performances were measured using recall and precision and the mean expected
|
1396 |
+
search length reduction factors.
|
1397 |
+
Overall, it was found that the Colon Classification-based systems did not
|
1398 |
+
perform significantly better than the other systems.
|
1399 |
+
.B
|
1400 |
+
(Journal of Documentation, Vol. 37, No. I, March 1981, pp. 25-35)
|
1401 |
+
|
1402 |
+
.I 107
|
1403 |
+
.T
|
1404 |
+
User-Responsive Subject Control in Bibliographic Retrieval Systems
|
1405 |
+
.A
|
1406 |
+
Tague, J.M.
|
1407 |
+
.W
|
1408 |
+
A study was carried out of the relationship between the vocabulary of
|
1409 |
+
user queries and the vocabulary of documents relevant to the queries, and
|
1410 |
+
the value of adding to the document description record in a retrieval system
|
1411 |
+
keywords from previous queries for which the document had proved useful.
|
1412 |
+
Two test databases incorporating user query keywords were implemented at
|
1413 |
+
the School of Library and Information Science, University of Western
|
1414 |
+
Ontario. Clustering of the documents via title and user keywords, a
|
1415 |
+
statistical analysis of title-user keyword co-occurrences, and retrieval
|
1416 |
+
tests were used to examine the effect of the added keywords. Results
|
1417 |
+
showed the impracticality of the procedure in an operational setting, but
|
1418 |
+
indicated the value of analyses with sample data in the development and
|
1419 |
+
maintenance of keyword dictionaries and thesauri.
|
1420 |
+
.B
|
1421 |
+
(Information Processing & Management, Vol. 17, No. 3, 1981, pp. 149-159)
|
1422 |
+
|
1423 |
+
.I 108
|
1424 |
+
.T
|
1425 |
+
A Program for Machine-Mediated Searching
|
1426 |
+
.A
|
1427 |
+
Toliver, D.
|
1428 |
+
.W
|
1429 |
+
A technique of online instruction and assistance to bibliographic data
|
1430 |
+
base searchers called Individualized Instruction for Data Access (IIDA) is
|
1431 |
+
being developed by Drexel University. IIDA assists searchers by providing
|
1432 |
+
feedback based on real-time analysis while searches are being performed.
|
1433 |
+
Extensive help facilities which draw on this analysis are available to
|
1434 |
+
users. Much of the project's experimental work, as described elsewhere,
|
1435 |
+
is concerned with the process of searching and the behavior of searchers.
|
1436 |
+
This paper will largely address itself to the project's computer system, which
|
1437 |
+
is being developed by subcontract with the Franklin Institute's Science
|
1438 |
+
Information Services.
|
1439 |
+
.B
|
1440 |
+
(Information Processing & Management, Vol. 17, No. 2, 1981, pp. 61-68)
|
1441 |
+
|
1442 |
+
.I 109
|
1443 |
+
.T
|
1444 |
+
Author Cocitation: A Literature Measure of Intellectual Structure
|
1445 |
+
.A
|
1446 |
+
White, H.D.
|
1447 |
+
Griffith, B.C.
|
1448 |
+
.W
|
1449 |
+
It is shown that the mapping of a particular area of science, in this
|
1450 |
+
case information science, can be done using authors as units of analysis and
|
1451 |
+
the cocitations of pairs of authors as the variable that indicates their
|
1452 |
+
"distances" from each other. The analysis assumes that the more two authors
|
1453 |
+
are cited together, the closer the relationship between them. The raw data
|
1454 |
+
are cocitation counts drawn online from Social Scisearch (Social Sciences
|
1455 |
+
Citation Index) over the period 1972-1979. GThe resulting map shows
|
1456 |
+
(1) identifiable author groups (akin to "schools") of information science,
|
1457 |
+
(2) locations of these groups with respect to each other, (3) the degree of
|
1458 |
+
centrality and peripherality of authors within groups, (4) proximities of
|
1459 |
+
authors within group and across group boundaries ("border authors" who seem
|
1460 |
+
to connect various areas of research), and (5) positions of authors with
|
1461 |
+
respect to the map's axes, which were arbitrarily set spanning the most
|
1462 |
+
divergent groups in order to aid interpretation. Cocitation analysis of
|
1463 |
+
authors offers a new technique that might contribute to the understanding of
|
1464 |
+
intellectual structure in the sciences and possibly in other areas to the
|
1465 |
+
extent that those areas rely on serial publications. The technique
|
1466 |
+
establishes authors, as well as documents, as an effective unit in
|
1467 |
+
analyzing subject specialties.
|
1468 |
+
.B
|
1469 |
+
(JASIS, Vol. 32, No. 3, May 1981, pp. 163-171)
|
1470 |
+
|
1471 |
+
.I 110
|
1472 |
+
.T
|
1473 |
+
Progress in Documentation. Word Processing:
|
1474 |
+
An Introduction and Appraisal
|
1475 |
+
.A
|
1476 |
+
Whitehead, J.
|
1477 |
+
.W
|
1478 |
+
The "Office of the Future," "Office Technology," "Word Processing,"
|
1479 |
+
"Electronic Mail," "Electronic Communications," "Convergence," "Information
|
1480 |
+
Management." These are all terms included in the current list of buzz words
|
1481 |
+
used to describe current activities in the office technology area. The high
|
1482 |
+
level of investment in factories and plants and the ever-increasing fight to
|
1483 |
+
improve productivity by automating the dull, routine jobs are usually quoted
|
1484 |
+
and compared with the extremely low investment in improving and automating
|
1485 |
+
the equally tedious routine jobs in the office environment; the investment
|
1486 |
+
in the factory is quoted as being ten times greater per employee than in the
|
1487 |
+
office. This, however, is changing rapidly and investment on a large scale
|
1488 |
+
is already taking place in manhy areas as present-day inflation bites hard,
|
1489 |
+
forcing many companies and organizations to take a much closer look at their
|
1490 |
+
office operations.
|
1491 |
+
.B
|
1492 |
+
(Journal of Documentation, Vol. 36, No. 4, December 1980, pp. 313-341)
|
1493 |
+
|
1494 |
+
.I 111
|
1495 |
+
.T
|
1496 |
+
Document Clustering Using an Inverted File Approach
|
1497 |
+
.A
|
1498 |
+
Willett, P.
|
1499 |
+
.W
|
1500 |
+
An automated document clustering procedure is described which does not
|
1501 |
+
require the use of an inter-document similarity matrix and which is independent
|
1502 |
+
of the order in which the documents are processed. The procedure makes use of
|
1503 |
+
an initial set of clusters which is derived from certain of the terms in the
|
1504 |
+
indexing vocabulary used to characterise the documents in the file. The
|
1505 |
+
retrieval effectiveness obtained using the clustered file is compared with that
|
1506 |
+
obtained from serial searching and from use of the single-linkage clustering
|
1507 |
+
method.
|
1508 |
+
.B
|
1509 |
+
(Journal of Information Science, 2, 1980, pp. 222-231)
|
1510 |
+
|
1511 |
+
.I 112
|
1512 |
+
.T
|
1513 |
+
A Fast Procedure for the Calculation of Similarity Coefficients in
|
1514 |
+
in Automatic Classification
|
1515 |
+
.A
|
1516 |
+
Willett, P.
|
1517 |
+
.W
|
1518 |
+
A fast algorithm is described for comparing the lists of terms representing
|
1519 |
+
documents in automatic classification experiments. The speed of the procedure
|
1520 |
+
arises from the fact that all of the non-zero-valued coefficicents for a given
|
1521 |
+
document are identified together, using an inverted file to the terms in the
|
1522 |
+
document collection. The complexity and running time of the algorithm are
|
1523 |
+
compared with previously described procedures.
|
1524 |
+
.B
|
1525 |
+
(Information Processing & Management, Vol. 17, No. 2, 1981, pp. 53-60)
|
content/CISI.REL
ADDED
@@ -0,0 +1,3114 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
1 28 0 0.000000
|
2 |
+
1 35 0 0.000000
|
3 |
+
1 38 0 0.000000
|
4 |
+
1 42 0 0.000000
|
5 |
+
1 43 0 0.000000
|
6 |
+
1 52 0 0.000000
|
7 |
+
1 65 0 0.000000
|
8 |
+
1 76 0 0.000000
|
9 |
+
1 86 0 0.000000
|
10 |
+
1 150 0 0.000000
|
11 |
+
1 189 0 0.000000
|
12 |
+
1 192 0 0.000000
|
13 |
+
1 193 0 0.000000
|
14 |
+
1 195 0 0.000000
|
15 |
+
1 215 0 0.000000
|
16 |
+
1 269 0 0.000000
|
17 |
+
1 291 0 0.000000
|
18 |
+
1 320 0 0.000000
|
19 |
+
1 429 0 0.000000
|
20 |
+
1 465 0 0.000000
|
21 |
+
1 466 0 0.000000
|
22 |
+
1 482 0 0.000000
|
23 |
+
1 483 0 0.000000
|
24 |
+
1 510 0 0.000000
|
25 |
+
1 524 0 0.000000
|
26 |
+
1 541 0 0.000000
|
27 |
+
1 576 0 0.000000
|
28 |
+
1 582 0 0.000000
|
29 |
+
1 589 0 0.000000
|
30 |
+
1 603 0 0.000000
|
31 |
+
1 650 0 0.000000
|
32 |
+
1 680 0 0.000000
|
33 |
+
1 711 0 0.000000
|
34 |
+
1 722 0 0.000000
|
35 |
+
1 726 0 0.000000
|
36 |
+
1 783 0 0.000000
|
37 |
+
1 813 0 0.000000
|
38 |
+
1 820 0 0.000000
|
39 |
+
1 868 0 0.000000
|
40 |
+
1 869 0 0.000000
|
41 |
+
1 894 0 0.000000
|
42 |
+
1 1162 0 0.000000
|
43 |
+
1 1164 0 0.000000
|
44 |
+
1 1195 0 0.000000
|
45 |
+
1 1196 0 0.000000
|
46 |
+
1 1281 0 0.000000
|
47 |
+
2 29 0 0.000000
|
48 |
+
2 68 0 0.000000
|
49 |
+
2 197 0 0.000000
|
50 |
+
2 213 0 0.000000
|
51 |
+
2 214 0 0.000000
|
52 |
+
2 309 0 0.000000
|
53 |
+
2 319 0 0.000000
|
54 |
+
2 324 0 0.000000
|
55 |
+
2 429 0 0.000000
|
56 |
+
2 499 0 0.000000
|
57 |
+
2 636 0 0.000000
|
58 |
+
2 669 0 0.000000
|
59 |
+
2 670 0 0.000000
|
60 |
+
2 674 0 0.000000
|
61 |
+
2 690 0 0.000000
|
62 |
+
2 692 0 0.000000
|
63 |
+
2 695 0 0.000000
|
64 |
+
2 700 0 0.000000
|
65 |
+
2 704 0 0.000000
|
66 |
+
2 709 0 0.000000
|
67 |
+
2 720 0 0.000000
|
68 |
+
2 731 0 0.000000
|
69 |
+
2 733 0 0.000000
|
70 |
+
2 738 0 0.000000
|
71 |
+
2 740 0 0.000000
|
72 |
+
2 1136 0 0.000000
|
73 |
+
3 60 0 0.000000
|
74 |
+
3 85 0 0.000000
|
75 |
+
3 114 0 0.000000
|
76 |
+
3 123 0 0.000000
|
77 |
+
3 126 0 0.000000
|
78 |
+
3 131 0 0.000000
|
79 |
+
3 133 0 0.000000
|
80 |
+
3 136 0 0.000000
|
81 |
+
3 138 0 0.000000
|
82 |
+
3 140 0 0.000000
|
83 |
+
3 346 0 0.000000
|
84 |
+
3 359 0 0.000000
|
85 |
+
3 363 0 0.000000
|
86 |
+
3 372 0 0.000000
|
87 |
+
3 412 0 0.000000
|
88 |
+
3 445 0 0.000000
|
89 |
+
3 454 0 0.000000
|
90 |
+
3 461 0 0.000000
|
91 |
+
3 463 0 0.000000
|
92 |
+
3 469 0 0.000000
|
93 |
+
3 532 0 0.000000
|
94 |
+
3 537 0 0.000000
|
95 |
+
3 540 0 0.000000
|
96 |
+
3 553 0 0.000000
|
97 |
+
3 554 0 0.000000
|
98 |
+
3 555 0 0.000000
|
99 |
+
3 585 0 0.000000
|
100 |
+
3 590 0 0.000000
|
101 |
+
3 599 0 0.000000
|
102 |
+
3 640 0 0.000000
|
103 |
+
3 660 0 0.000000
|
104 |
+
3 664 0 0.000000
|
105 |
+
3 803 0 0.000000
|
106 |
+
3 901 0 0.000000
|
107 |
+
3 909 0 0.000000
|
108 |
+
3 911 0 0.000000
|
109 |
+
3 1027 0 0.000000
|
110 |
+
3 1053 0 0.000000
|
111 |
+
3 1169 0 0.000000
|
112 |
+
3 1179 0 0.000000
|
113 |
+
3 1181 0 0.000000
|
114 |
+
3 1190 0 0.000000
|
115 |
+
3 1191 0 0.000000
|
116 |
+
3 1326 0 0.000000
|
117 |
+
4 310 0 0.000000
|
118 |
+
4 315 0 0.000000
|
119 |
+
4 321 0 0.000000
|
120 |
+
4 329 0 0.000000
|
121 |
+
4 332 0 0.000000
|
122 |
+
4 420 0 0.000000
|
123 |
+
4 601 0 0.000000
|
124 |
+
4 980 0 0.000000
|
125 |
+
5 32 0 0.000000
|
126 |
+
5 56 0 0.000000
|
127 |
+
5 65 0 0.000000
|
128 |
+
5 114 0 0.000000
|
129 |
+
5 124 0 0.000000
|
130 |
+
5 137 0 0.000000
|
131 |
+
5 187 0 0.000000
|
132 |
+
5 188 0 0.000000
|
133 |
+
5 191 0 0.000000
|
134 |
+
5 241 0 0.000000
|
135 |
+
5 339 0 0.000000
|
136 |
+
5 370 0 0.000000
|
137 |
+
5 400 0 0.000000
|
138 |
+
5 451 0 0.000000
|
139 |
+
5 453 0 0.000000
|
140 |
+
5 471 0 0.000000
|
141 |
+
5 525 0 0.000000
|
142 |
+
5 528 0 0.000000
|
143 |
+
5 642 0 0.000000
|
144 |
+
5 648 0 0.000000
|
145 |
+
5 692 0 0.000000
|
146 |
+
5 1035 0 0.000000
|
147 |
+
5 1246 0 0.000000
|
148 |
+
5 1356 0 0.000000
|
149 |
+
6 400 0 0.000000
|
150 |
+
7 310 0 0.000000
|
151 |
+
7 320 0 0.000000
|
152 |
+
7 332 0 0.000000
|
153 |
+
7 375 0 0.000000
|
154 |
+
7 376 0 0.000000
|
155 |
+
7 645 0 0.000000
|
156 |
+
7 724 0 0.000000
|
157 |
+
7 725 0 0.000000
|
158 |
+
8 37 0 0.000000
|
159 |
+
8 40 0 0.000000
|
160 |
+
8 65 0 0.000000
|
161 |
+
8 507 0 0.000000
|
162 |
+
8 529 0 0.000000
|
163 |
+
8 707 0 0.000000
|
164 |
+
8 760 0 0.000000
|
165 |
+
8 802 0 0.000000
|
166 |
+
8 864 0 0.000000
|
167 |
+
8 900 0 0.000000
|
168 |
+
8 1024 0 0.000000
|
169 |
+
8 1161 0 0.000000
|
170 |
+
8 1225 0 0.000000
|
171 |
+
8 1226 0 0.000000
|
172 |
+
8 1267 0 0.000000
|
173 |
+
8 1382 0 0.000000
|
174 |
+
8 1409 0 0.000000
|
175 |
+
8 1414 0 0.000000
|
176 |
+
9 6 0 0.000000
|
177 |
+
9 174 0 0.000000
|
178 |
+
9 175 0 0.000000
|
179 |
+
9 179 0 0.000000
|
180 |
+
9 212 0 0.000000
|
181 |
+
9 320 0 0.000000
|
182 |
+
9 324 0 0.000000
|
183 |
+
9 329 0 0.000000
|
184 |
+
9 566 0 0.000000
|
185 |
+
9 572 0 0.000000
|
186 |
+
9 577 0 0.000000
|
187 |
+
9 600 0 0.000000
|
188 |
+
9 1077 0 0.000000
|
189 |
+
9 1120 0 0.000000
|
190 |
+
9 1129 0 0.000000
|
191 |
+
9 1130 0 0.000000
|
192 |
+
9 1131 0 0.000000
|
193 |
+
9 1159 0 0.000000
|
194 |
+
9 1161 0 0.000000
|
195 |
+
9 1162 0 0.000000
|
196 |
+
9 1164 0 0.000000
|
197 |
+
9 1165 0 0.000000
|
198 |
+
9 1185 0 0.000000
|
199 |
+
9 1190 0 0.000000
|
200 |
+
9 1191 0 0.000000
|
201 |
+
9 1224 0 0.000000
|
202 |
+
9 1225 0 0.000000
|
203 |
+
9 1267 0 0.000000
|
204 |
+
9 1294 0 0.000000
|
205 |
+
9 1323 0 0.000000
|
206 |
+
9 1327 0 0.000000
|
207 |
+
9 1382 0 0.000000
|
208 |
+
9 1388 0 0.000000
|
209 |
+
9 1427 0 0.000000
|
210 |
+
10 25 0 0.000000
|
211 |
+
10 175 0 0.000000
|
212 |
+
10 228 0 0.000000
|
213 |
+
10 229 0 0.000000
|
214 |
+
10 233 0 0.000000
|
215 |
+
10 277 0 0.000000
|
216 |
+
10 399 0 0.000000
|
217 |
+
10 462 0 0.000000
|
218 |
+
10 536 0 0.000000
|
219 |
+
10 540 0 0.000000
|
220 |
+
10 574 0 0.000000
|
221 |
+
10 605 0 0.000000
|
222 |
+
10 615 0 0.000000
|
223 |
+
10 829 0 0.000000
|
224 |
+
10 972 0 0.000000
|
225 |
+
10 1045 0 0.000000
|
226 |
+
10 1082 0 0.000000
|
227 |
+
10 1116 0 0.000000
|
228 |
+
10 1117 0 0.000000
|
229 |
+
10 1119 0 0.000000
|
230 |
+
10 1123 0 0.000000
|
231 |
+
10 1141 0 0.000000
|
232 |
+
10 1159 0 0.000000
|
233 |
+
10 1173 0 0.000000
|
234 |
+
10 1204 0 0.000000
|
235 |
+
10 1385 0 0.000000
|
236 |
+
11 2 0 0.000000
|
237 |
+
11 15 0 0.000000
|
238 |
+
11 32 0 0.000000
|
239 |
+
11 33 0 0.000000
|
240 |
+
11 37 0 0.000000
|
241 |
+
11 41 0 0.000000
|
242 |
+
11 63 0 0.000000
|
243 |
+
11 67 0 0.000000
|
244 |
+
11 87 0 0.000000
|
245 |
+
11 90 0 0.000000
|
246 |
+
11 95 0 0.000000
|
247 |
+
11 110 0 0.000000
|
248 |
+
11 113 0 0.000000
|
249 |
+
11 116 0 0.000000
|
250 |
+
11 121 0 0.000000
|
251 |
+
11 153 0 0.000000
|
252 |
+
11 160 0 0.000000
|
253 |
+
11 163 0 0.000000
|
254 |
+
11 165 0 0.000000
|
255 |
+
11 166 0 0.000000
|
256 |
+
11 169 0 0.000000
|
257 |
+
11 172 0 0.000000
|
258 |
+
11 199 0 0.000000
|
259 |
+
11 202 0 0.000000
|
260 |
+
11 215 0 0.000000
|
261 |
+
11 219 0 0.000000
|
262 |
+
11 223 0 0.000000
|
263 |
+
11 243 0 0.000000
|
264 |
+
11 252 0 0.000000
|
265 |
+
11 254 0 0.000000
|
266 |
+
11 266 0 0.000000
|
267 |
+
11 309 0 0.000000
|
268 |
+
11 314 0 0.000000
|
269 |
+
11 327 0 0.000000
|
270 |
+
11 345 0 0.000000
|
271 |
+
11 355 0 0.000000
|
272 |
+
11 356 0 0.000000
|
273 |
+
11 360 0 0.000000
|
274 |
+
11 371 0 0.000000
|
275 |
+
11 372 0 0.000000
|
276 |
+
11 373 0 0.000000
|
277 |
+
11 381 0 0.000000
|
278 |
+
11 386 0 0.000000
|
279 |
+
11 391 0 0.000000
|
280 |
+
11 395 0 0.000000
|
281 |
+
11 398 0 0.000000
|
282 |
+
11 415 0 0.000000
|
283 |
+
11 439 0 0.000000
|
284 |
+
11 440 0 0.000000
|
285 |
+
11 453 0 0.000000
|
286 |
+
11 456 0 0.000000
|
287 |
+
11 513 0 0.000000
|
288 |
+
11 533 0 0.000000
|
289 |
+
11 544 0 0.000000
|
290 |
+
11 547 0 0.000000
|
291 |
+
11 560 0 0.000000
|
292 |
+
11 602 0 0.000000
|
293 |
+
11 605 0 0.000000
|
294 |
+
11 656 0 0.000000
|
295 |
+
11 657 0 0.000000
|
296 |
+
11 666 0 0.000000
|
297 |
+
11 714 0 0.000000
|
298 |
+
11 716 0 0.000000
|
299 |
+
11 718 0 0.000000
|
300 |
+
11 719 0 0.000000
|
301 |
+
11 723 0 0.000000
|
302 |
+
11 728 0 0.000000
|
303 |
+
11 731 0 0.000000
|
304 |
+
11 733 0 0.000000
|
305 |
+
11 737 0 0.000000
|
306 |
+
11 738 0 0.000000
|
307 |
+
11 739 0 0.000000
|
308 |
+
11 763 0 0.000000
|
309 |
+
11 771 0 0.000000
|
310 |
+
11 772 0 0.000000
|
311 |
+
11 788 0 0.000000
|
312 |
+
11 789 0 0.000000
|
313 |
+
11 821 0 0.000000
|
314 |
+
11 828 0 0.000000
|
315 |
+
11 837 0 0.000000
|
316 |
+
11 839 0 0.000000
|
317 |
+
11 845 0 0.000000
|
318 |
+
11 899 0 0.000000
|
319 |
+
11 952 0 0.000000
|
320 |
+
11 953 0 0.000000
|
321 |
+
11 965 0 0.000000
|
322 |
+
11 967 0 0.000000
|
323 |
+
11 1080 0 0.000000
|
324 |
+
11 1081 0 0.000000
|
325 |
+
11 1089 0 0.000000
|
326 |
+
11 1094 0 0.000000
|
327 |
+
11 1095 0 0.000000
|
328 |
+
11 1096 0 0.000000
|
329 |
+
11 1098 0 0.000000
|
330 |
+
11 1099 0 0.000000
|
331 |
+
11 1102 0 0.000000
|
332 |
+
11 1110 0 0.000000
|
333 |
+
11 1113 0 0.000000
|
334 |
+
11 1114 0 0.000000
|
335 |
+
11 1121 0 0.000000
|
336 |
+
11 1122 0 0.000000
|
337 |
+
11 1128 0 0.000000
|
338 |
+
11 1151 0 0.000000
|
339 |
+
11 1155 0 0.000000
|
340 |
+
11 1156 0 0.000000
|
341 |
+
11 1158 0 0.000000
|
342 |
+
11 1160 0 0.000000
|
343 |
+
11 1223 0 0.000000
|
344 |
+
11 1228 0 0.000000
|
345 |
+
11 1235 0 0.000000
|
346 |
+
11 1241 0 0.000000
|
347 |
+
11 1254 0 0.000000
|
348 |
+
11 1256 0 0.000000
|
349 |
+
11 1257 0 0.000000
|
350 |
+
11 1264 0 0.000000
|
351 |
+
11 1268 0 0.000000
|
352 |
+
11 1275 0 0.000000
|
353 |
+
11 1284 0 0.000000
|
354 |
+
11 1295 0 0.000000
|
355 |
+
11 1298 0 0.000000
|
356 |
+
11 1303 0 0.000000
|
357 |
+
11 1309 0 0.000000
|
358 |
+
11 1319 0 0.000000
|
359 |
+
11 1373 0 0.000000
|
360 |
+
11 1404 0 0.000000
|
361 |
+
11 1418 0 0.000000
|
362 |
+
11 1446 0 0.000000
|
363 |
+
12 53 0 0.000000
|
364 |
+
12 133 0 0.000000
|
365 |
+
12 136 0 0.000000
|
366 |
+
12 341 0 0.000000
|
367 |
+
12 347 0 0.000000
|
368 |
+
12 376 0 0.000000
|
369 |
+
12 899 0 0.000000
|
370 |
+
12 1190 0 0.000000
|
371 |
+
12 1191 0 0.000000
|
372 |
+
12 1209 0 0.000000
|
373 |
+
12 1290 0 0.000000
|
374 |
+
12 1293 0 0.000000
|
375 |
+
12 1363 0 0.000000
|
376 |
+
13 27 0 0.000000
|
377 |
+
13 28 0 0.000000
|
378 |
+
13 42 0 0.000000
|
379 |
+
13 49 0 0.000000
|
380 |
+
13 50 0 0.000000
|
381 |
+
13 52 0 0.000000
|
382 |
+
13 57 0 0.000000
|
383 |
+
13 59 0 0.000000
|
384 |
+
13 61 0 0.000000
|
385 |
+
13 67 0 0.000000
|
386 |
+
13 72 0 0.000000
|
387 |
+
13 73 0 0.000000
|
388 |
+
13 75 0 0.000000
|
389 |
+
13 77 0 0.000000
|
390 |
+
13 84 0 0.000000
|
391 |
+
13 114 0 0.000000
|
392 |
+
13 120 0 0.000000
|
393 |
+
13 128 0 0.000000
|
394 |
+
13 134 0 0.000000
|
395 |
+
13 137 0 0.000000
|
396 |
+
13 139 0 0.000000
|
397 |
+
13 146 0 0.000000
|
398 |
+
13 153 0 0.000000
|
399 |
+
13 164 0 0.000000
|
400 |
+
13 167 0 0.000000
|
401 |
+
13 175 0 0.000000
|
402 |
+
13 176 0 0.000000
|
403 |
+
13 194 0 0.000000
|
404 |
+
13 198 0 0.000000
|
405 |
+
13 223 0 0.000000
|
406 |
+
13 244 0 0.000000
|
407 |
+
13 266 0 0.000000
|
408 |
+
13 307 0 0.000000
|
409 |
+
13 309 0 0.000000
|
410 |
+
13 311 0 0.000000
|
411 |
+
13 327 0 0.000000
|
412 |
+
13 328 0 0.000000
|
413 |
+
13 347 0 0.000000
|
414 |
+
13 389 0 0.000000
|
415 |
+
13 458 0 0.000000
|
416 |
+
13 474 0 0.000000
|
417 |
+
13 484 0 0.000000
|
418 |
+
13 486 0 0.000000
|
419 |
+
13 493 0 0.000000
|
420 |
+
13 494 0 0.000000
|
421 |
+
13 508 0 0.000000
|
422 |
+
13 509 0 0.000000
|
423 |
+
13 514 0 0.000000
|
424 |
+
13 519 0 0.000000
|
425 |
+
13 523 0 0.000000
|
426 |
+
13 525 0 0.000000
|
427 |
+
13 532 0 0.000000
|
428 |
+
13 538 0 0.000000
|
429 |
+
13 565 0 0.000000
|
430 |
+
13 595 0 0.000000
|
431 |
+
13 596 0 0.000000
|
432 |
+
13 608 0 0.000000
|
433 |
+
13 634 0 0.000000
|
434 |
+
13 646 0 0.000000
|
435 |
+
13 656 0 0.000000
|
436 |
+
13 658 0 0.000000
|
437 |
+
13 659 0 0.000000
|
438 |
+
13 696 0 0.000000
|
439 |
+
13 702 0 0.000000
|
440 |
+
13 705 0 0.000000
|
441 |
+
13 720 0 0.000000
|
442 |
+
13 728 0 0.000000
|
443 |
+
13 731 0 0.000000
|
444 |
+
13 752 0 0.000000
|
445 |
+
13 762 0 0.000000
|
446 |
+
13 780 0 0.000000
|
447 |
+
13 785 0 0.000000
|
448 |
+
13 795 0 0.000000
|
449 |
+
13 806 0 0.000000
|
450 |
+
13 815 0 0.000000
|
451 |
+
13 826 0 0.000000
|
452 |
+
13 827 0 0.000000
|
453 |
+
13 829 0 0.000000
|
454 |
+
13 835 0 0.000000
|
455 |
+
13 956 0 0.000000
|
456 |
+
13 966 0 0.000000
|
457 |
+
13 1054 0 0.000000
|
458 |
+
13 1124 0 0.000000
|
459 |
+
13 1126 0 0.000000
|
460 |
+
13 1127 0 0.000000
|
461 |
+
13 1138 0 0.000000
|
462 |
+
13 1139 0 0.000000
|
463 |
+
13 1143 0 0.000000
|
464 |
+
13 1144 0 0.000000
|
465 |
+
13 1282 0 0.000000
|
466 |
+
13 1307 0 0.000000
|
467 |
+
14 45 0 0.000000
|
468 |
+
14 420 0 0.000000
|
469 |
+
14 890 0 0.000000
|
470 |
+
15 18 0 0.000000
|
471 |
+
15 27 0 0.000000
|
472 |
+
15 36 0 0.000000
|
473 |
+
15 49 0 0.000000
|
474 |
+
15 56 0 0.000000
|
475 |
+
15 59 0 0.000000
|
476 |
+
15 67 0 0.000000
|
477 |
+
15 74 0 0.000000
|
478 |
+
15 83 0 0.000000
|
479 |
+
15 126 0 0.000000
|
480 |
+
15 158 0 0.000000
|
481 |
+
15 164 0 0.000000
|
482 |
+
15 167 0 0.000000
|
483 |
+
15 192 0 0.000000
|
484 |
+
15 214 0 0.000000
|
485 |
+
15 222 0 0.000000
|
486 |
+
15 223 0 0.000000
|
487 |
+
15 250 0 0.000000
|
488 |
+
15 281 0 0.000000
|
489 |
+
15 292 0 0.000000
|
490 |
+
15 295 0 0.000000
|
491 |
+
15 299 0 0.000000
|
492 |
+
15 307 0 0.000000
|
493 |
+
15 331 0 0.000000
|
494 |
+
15 336 0 0.000000
|
495 |
+
15 338 0 0.000000
|
496 |
+
15 348 0 0.000000
|
497 |
+
15 365 0 0.000000
|
498 |
+
15 366 0 0.000000
|
499 |
+
15 367 0 0.000000
|
500 |
+
15 368 0 0.000000
|
501 |
+
15 372 0 0.000000
|
502 |
+
15 381 0 0.000000
|
503 |
+
15 446 0 0.000000
|
504 |
+
15 458 0 0.000000
|
505 |
+
15 465 0 0.000000
|
506 |
+
15 466 0 0.000000
|
507 |
+
15 482 0 0.000000
|
508 |
+
15 490 0 0.000000
|
509 |
+
15 491 0 0.000000
|
510 |
+
15 495 0 0.000000
|
511 |
+
15 497 0 0.000000
|
512 |
+
15 507 0 0.000000
|
513 |
+
15 520 0 0.000000
|
514 |
+
15 528 0 0.000000
|
515 |
+
15 591 0 0.000000
|
516 |
+
15 594 0 0.000000
|
517 |
+
15 623 0 0.000000
|
518 |
+
15 629 0 0.000000
|
519 |
+
15 639 0 0.000000
|
520 |
+
15 690 0 0.000000
|
521 |
+
15 720 0 0.000000
|
522 |
+
15 723 0 0.000000
|
523 |
+
15 724 0 0.000000
|
524 |
+
15 727 0 0.000000
|
525 |
+
15 728 0 0.000000
|
526 |
+
15 731 0 0.000000
|
527 |
+
15 779 0 0.000000
|
528 |
+
15 822 0 0.000000
|
529 |
+
15 834 0 0.000000
|
530 |
+
15 839 0 0.000000
|
531 |
+
15 848 0 0.000000
|
532 |
+
15 849 0 0.000000
|
533 |
+
15 865 0 0.000000
|
534 |
+
15 872 0 0.000000
|
535 |
+
15 897 0 0.000000
|
536 |
+
15 1100 0 0.000000
|
537 |
+
15 1161 0 0.000000
|
538 |
+
15 1248 0 0.000000
|
539 |
+
15 1305 0 0.000000
|
540 |
+
15 1353 0 0.000000
|
541 |
+
15 1358 0 0.000000
|
542 |
+
15 1363 0 0.000000
|
543 |
+
15 1366 0 0.000000
|
544 |
+
15 1368 0 0.000000
|
545 |
+
15 1371 0 0.000000
|
546 |
+
15 1372 0 0.000000
|
547 |
+
15 1374 0 0.000000
|
548 |
+
15 1375 0 0.000000
|
549 |
+
15 1376 0 0.000000
|
550 |
+
15 1377 0 0.000000
|
551 |
+
15 1410 0 0.000000
|
552 |
+
16 123 0 0.000000
|
553 |
+
16 126 0 0.000000
|
554 |
+
16 169 0 0.000000
|
555 |
+
16 197 0 0.000000
|
556 |
+
16 375 0 0.000000
|
557 |
+
16 481 0 0.000000
|
558 |
+
16 497 0 0.000000
|
559 |
+
16 508 0 0.000000
|
560 |
+
16 528 0 0.000000
|
561 |
+
16 529 0 0.000000
|
562 |
+
16 534 0 0.000000
|
563 |
+
16 734 0 0.000000
|
564 |
+
16 854 0 0.000000
|
565 |
+
16 885 0 0.000000
|
566 |
+
16 947 0 0.000000
|
567 |
+
16 997 0 0.000000
|
568 |
+
16 1011 0 0.000000
|
569 |
+
16 1013 0 0.000000
|
570 |
+
16 1073 0 0.000000
|
571 |
+
16 1121 0 0.000000
|
572 |
+
16 1146 0 0.000000
|
573 |
+
16 1171 0 0.000000
|
574 |
+
16 1193 0 0.000000
|
575 |
+
16 1198 0 0.000000
|
576 |
+
16 1207 0 0.000000
|
577 |
+
16 1366 0 0.000000
|
578 |
+
17 34 0 0.000000
|
579 |
+
17 53 0 0.000000
|
580 |
+
17 252 0 0.000000
|
581 |
+
17 286 0 0.000000
|
582 |
+
17 375 0 0.000000
|
583 |
+
17 376 0 0.000000
|
584 |
+
17 465 0 0.000000
|
585 |
+
17 467 0 0.000000
|
586 |
+
17 482 0 0.000000
|
587 |
+
17 491 0 0.000000
|
588 |
+
17 507 0 0.000000
|
589 |
+
17 529 0 0.000000
|
590 |
+
17 578 0 0.000000
|
591 |
+
17 582 0 0.000000
|
592 |
+
17 633 0 0.000000
|
593 |
+
17 680 0 0.000000
|
594 |
+
17 721 0 0.000000
|
595 |
+
17 724 0 0.000000
|
596 |
+
17 763 0 0.000000
|
597 |
+
17 1014 0 0.000000
|
598 |
+
17 1057 0 0.000000
|
599 |
+
17 1058 0 0.000000
|
600 |
+
17 1059 0 0.000000
|
601 |
+
17 1060 0 0.000000
|
602 |
+
17 1371 0 0.000000
|
603 |
+
17 1415 0 0.000000
|
604 |
+
18 66 0 0.000000
|
605 |
+
18 80 0 0.000000
|
606 |
+
18 175 0 0.000000
|
607 |
+
18 695 0 0.000000
|
608 |
+
18 709 0 0.000000
|
609 |
+
18 833 0 0.000000
|
610 |
+
18 1026 0 0.000000
|
611 |
+
18 1092 0 0.000000
|
612 |
+
18 1180 0 0.000000
|
613 |
+
18 1292 0 0.000000
|
614 |
+
18 1452 0 0.000000
|
615 |
+
19 26 0 0.000000
|
616 |
+
19 38 0 0.000000
|
617 |
+
19 39 0 0.000000
|
618 |
+
19 62 0 0.000000
|
619 |
+
19 65 0 0.000000
|
620 |
+
19 71 0 0.000000
|
621 |
+
19 77 0 0.000000
|
622 |
+
19 117 0 0.000000
|
623 |
+
19 123 0 0.000000
|
624 |
+
19 159 0 0.000000
|
625 |
+
19 175 0 0.000000
|
626 |
+
19 179 0 0.000000
|
627 |
+
19 320 0 0.000000
|
628 |
+
19 419 0 0.000000
|
629 |
+
19 421 0 0.000000
|
630 |
+
19 422 0 0.000000
|
631 |
+
19 434 0 0.000000
|
632 |
+
19 442 0 0.000000
|
633 |
+
19 479 0 0.000000
|
634 |
+
19 483 0 0.000000
|
635 |
+
19 487 0 0.000000
|
636 |
+
19 488 0 0.000000
|
637 |
+
19 501 0 0.000000
|
638 |
+
19 508 0 0.000000
|
639 |
+
19 511 0 0.000000
|
640 |
+
19 518 0 0.000000
|
641 |
+
19 520 0 0.000000
|
642 |
+
19 521 0 0.000000
|
643 |
+
19 538 0 0.000000
|
644 |
+
19 562 0 0.000000
|
645 |
+
19 570 0 0.000000
|
646 |
+
19 596 0 0.000000
|
647 |
+
19 636 0 0.000000
|
648 |
+
19 641 0 0.000000
|
649 |
+
19 669 0 0.000000
|
650 |
+
19 670 0 0.000000
|
651 |
+
19 671 0 0.000000
|
652 |
+
19 678 0 0.000000
|
653 |
+
19 687 0 0.000000
|
654 |
+
19 689 0 0.000000
|
655 |
+
19 695 0 0.000000
|
656 |
+
19 698 0 0.000000
|
657 |
+
19 699 0 0.000000
|
658 |
+
19 700 0 0.000000
|
659 |
+
19 704 0 0.000000
|
660 |
+
19 706 0 0.000000
|
661 |
+
19 708 0 0.000000
|
662 |
+
19 709 0 0.000000
|
663 |
+
19 714 0 0.000000
|
664 |
+
19 790 0 0.000000
|
665 |
+
19 802 0 0.000000
|
666 |
+
19 810 0 0.000000
|
667 |
+
19 812 0 0.000000
|
668 |
+
19 820 0 0.000000
|
669 |
+
19 835 0 0.000000
|
670 |
+
19 836 0 0.000000
|
671 |
+
19 851 0 0.000000
|
672 |
+
19 855 0 0.000000
|
673 |
+
19 862 0 0.000000
|
674 |
+
19 867 0 0.000000
|
675 |
+
19 868 0 0.000000
|
676 |
+
19 869 0 0.000000
|
677 |
+
19 871 0 0.000000
|
678 |
+
19 875 0 0.000000
|
679 |
+
19 876 0 0.000000
|
680 |
+
19 993 0 0.000000
|
681 |
+
19 1091 0 0.000000
|
682 |
+
19 1120 0 0.000000
|
683 |
+
19 1124 0 0.000000
|
684 |
+
19 1130 0 0.000000
|
685 |
+
19 1134 0 0.000000
|
686 |
+
19 1139 0 0.000000
|
687 |
+
19 1162 0 0.000000
|
688 |
+
19 1164 0 0.000000
|
689 |
+
19 1194 0 0.000000
|
690 |
+
19 1196 0 0.000000
|
691 |
+
19 1199 0 0.000000
|
692 |
+
19 1230 0 0.000000
|
693 |
+
19 1234 0 0.000000
|
694 |
+
19 1411 0 0.000000
|
695 |
+
19 1415 0 0.000000
|
696 |
+
20 27 0 0.000000
|
697 |
+
20 72 0 0.000000
|
698 |
+
20 73 0 0.000000
|
699 |
+
20 75 0 0.000000
|
700 |
+
20 77 0 0.000000
|
701 |
+
20 120 0 0.000000
|
702 |
+
20 128 0 0.000000
|
703 |
+
20 134 0 0.000000
|
704 |
+
20 150 0 0.000000
|
705 |
+
20 175 0 0.000000
|
706 |
+
20 190 0 0.000000
|
707 |
+
20 197 0 0.000000
|
708 |
+
20 224 0 0.000000
|
709 |
+
20 243 0 0.000000
|
710 |
+
20 244 0 0.000000
|
711 |
+
20 287 0 0.000000
|
712 |
+
20 374 0 0.000000
|
713 |
+
20 381 0 0.000000
|
714 |
+
20 382 0 0.000000
|
715 |
+
20 389 0 0.000000
|
716 |
+
20 390 0 0.000000
|
717 |
+
20 424 0 0.000000
|
718 |
+
20 448 0 0.000000
|
719 |
+
20 450 0 0.000000
|
720 |
+
20 458 0 0.000000
|
721 |
+
20 459 0 0.000000
|
722 |
+
20 465 0 0.000000
|
723 |
+
20 466 0 0.000000
|
724 |
+
20 468 0 0.000000
|
725 |
+
20 473 0 0.000000
|
726 |
+
20 474 0 0.000000
|
727 |
+
20 479 0 0.000000
|
728 |
+
20 483 0 0.000000
|
729 |
+
20 484 0 0.000000
|
730 |
+
20 485 0 0.000000
|
731 |
+
20 486 0 0.000000
|
732 |
+
20 487 0 0.000000
|
733 |
+
20 488 0 0.000000
|
734 |
+
20 492 0 0.000000
|
735 |
+
20 493 0 0.000000
|
736 |
+
20 494 0 0.000000
|
737 |
+
20 498 0 0.000000
|
738 |
+
20 504 0 0.000000
|
739 |
+
20 506 0 0.000000
|
740 |
+
20 519 0 0.000000
|
741 |
+
20 526 0 0.000000
|
742 |
+
20 534 0 0.000000
|
743 |
+
20 538 0 0.000000
|
744 |
+
20 547 0 0.000000
|
745 |
+
20 563 0 0.000000
|
746 |
+
20 564 0 0.000000
|
747 |
+
20 565 0 0.000000
|
748 |
+
20 576 0 0.000000
|
749 |
+
20 581 0 0.000000
|
750 |
+
20 586 0 0.000000
|
751 |
+
20 595 0 0.000000
|
752 |
+
20 596 0 0.000000
|
753 |
+
20 608 0 0.000000
|
754 |
+
20 609 0 0.000000
|
755 |
+
20 620 0 0.000000
|
756 |
+
20 625 0 0.000000
|
757 |
+
20 636 0 0.000000
|
758 |
+
20 646 0 0.000000
|
759 |
+
20 696 0 0.000000
|
760 |
+
20 702 0 0.000000
|
761 |
+
20 705 0 0.000000
|
762 |
+
20 720 0 0.000000
|
763 |
+
20 734 0 0.000000
|
764 |
+
20 742 0 0.000000
|
765 |
+
20 754 0 0.000000
|
766 |
+
20 773 0 0.000000
|
767 |
+
20 776 0 0.000000
|
768 |
+
20 780 0 0.000000
|
769 |
+
20 785 0 0.000000
|
770 |
+
20 795 0 0.000000
|
771 |
+
20 801 0 0.000000
|
772 |
+
20 806 0 0.000000
|
773 |
+
20 807 0 0.000000
|
774 |
+
20 809 0 0.000000
|
775 |
+
20 813 0 0.000000
|
776 |
+
20 815 0 0.000000
|
777 |
+
20 817 0 0.000000
|
778 |
+
20 820 0 0.000000
|
779 |
+
20 824 0 0.000000
|
780 |
+
20 826 0 0.000000
|
781 |
+
20 827 0 0.000000
|
782 |
+
20 829 0 0.000000
|
783 |
+
20 835 0 0.000000
|
784 |
+
20 845 0 0.000000
|
785 |
+
20 851 0 0.000000
|
786 |
+
20 852 0 0.000000
|
787 |
+
20 853 0 0.000000
|
788 |
+
20 855 0 0.000000
|
789 |
+
20 858 0 0.000000
|
790 |
+
20 859 0 0.000000
|
791 |
+
20 861 0 0.000000
|
792 |
+
20 863 0 0.000000
|
793 |
+
20 864 0 0.000000
|
794 |
+
20 866 0 0.000000
|
795 |
+
20 870 0 0.000000
|
796 |
+
20 871 0 0.000000
|
797 |
+
20 876 0 0.000000
|
798 |
+
20 894 0 0.000000
|
799 |
+
20 956 0 0.000000
|
800 |
+
20 966 0 0.000000
|
801 |
+
20 986 0 0.000000
|
802 |
+
20 1051 0 0.000000
|
803 |
+
20 1054 0 0.000000
|
804 |
+
20 1089 0 0.000000
|
805 |
+
20 1091 0 0.000000
|
806 |
+
20 1094 0 0.000000
|
807 |
+
20 1104 0 0.000000
|
808 |
+
20 1105 0 0.000000
|
809 |
+
20 1106 0 0.000000
|
810 |
+
20 1124 0 0.000000
|
811 |
+
20 1126 0 0.000000
|
812 |
+
20 1127 0 0.000000
|
813 |
+
20 1132 0 0.000000
|
814 |
+
20 1138 0 0.000000
|
815 |
+
20 1143 0 0.000000
|
816 |
+
20 1162 0 0.000000
|
817 |
+
20 1164 0 0.000000
|
818 |
+
20 1175 0 0.000000
|
819 |
+
20 1196 0 0.000000
|
820 |
+
20 1197 0 0.000000
|
821 |
+
20 1207 0 0.000000
|
822 |
+
20 1230 0 0.000000
|
823 |
+
20 1255 0 0.000000
|
824 |
+
20 1264 0 0.000000
|
825 |
+
20 1281 0 0.000000
|
826 |
+
20 1282 0 0.000000
|
827 |
+
20 1294 0 0.000000
|
828 |
+
20 1307 0 0.000000
|
829 |
+
20 1327 0 0.000000
|
830 |
+
20 1362 0 0.000000
|
831 |
+
20 1363 0 0.000000
|
832 |
+
20 1367 0 0.000000
|
833 |
+
20 1372 0 0.000000
|
834 |
+
20 1377 0 0.000000
|
835 |
+
20 1410 0 0.000000
|
836 |
+
20 1415 0 0.000000
|
837 |
+
20 1419 0 0.000000
|
838 |
+
20 1421 0 0.000000
|
839 |
+
20 1448 0 0.000000
|
840 |
+
21 6 0 0.000000
|
841 |
+
21 14 0 0.000000
|
842 |
+
21 22 0 0.000000
|
843 |
+
21 85 0 0.000000
|
844 |
+
21 171 0 0.000000
|
845 |
+
21 185 0 0.000000
|
846 |
+
21 186 0 0.000000
|
847 |
+
21 303 0 0.000000
|
848 |
+
21 339 0 0.000000
|
849 |
+
21 392 0 0.000000
|
850 |
+
21 400 0 0.000000
|
851 |
+
21 453 0 0.000000
|
852 |
+
21 839 0 0.000000
|
853 |
+
21 891 0 0.000000
|
854 |
+
21 896 0 0.000000
|
855 |
+
21 923 0 0.000000
|
856 |
+
21 924 0 0.000000
|
857 |
+
21 949 0 0.000000
|
858 |
+
21 985 0 0.000000
|
859 |
+
21 1020 0 0.000000
|
860 |
+
21 1021 0 0.000000
|
861 |
+
21 1147 0 0.000000
|
862 |
+
21 1149 0 0.000000
|
863 |
+
21 1206 0 0.000000
|
864 |
+
21 1356 0 0.000000
|
865 |
+
22 52 0 0.000000
|
866 |
+
22 64 0 0.000000
|
867 |
+
22 65 0 0.000000
|
868 |
+
22 72 0 0.000000
|
869 |
+
22 75 0 0.000000
|
870 |
+
22 133 0 0.000000
|
871 |
+
22 148 0 0.000000
|
872 |
+
22 190 0 0.000000
|
873 |
+
22 191 0 0.000000
|
874 |
+
22 192 0 0.000000
|
875 |
+
22 194 0 0.000000
|
876 |
+
22 197 0 0.000000
|
877 |
+
22 199 0 0.000000
|
878 |
+
22 202 0 0.000000
|
879 |
+
22 211 0 0.000000
|
880 |
+
22 213 0 0.000000
|
881 |
+
22 214 0 0.000000
|
882 |
+
22 218 0 0.000000
|
883 |
+
22 222 0 0.000000
|
884 |
+
22 223 0 0.000000
|
885 |
+
22 224 0 0.000000
|
886 |
+
22 254 0 0.000000
|
887 |
+
22 375 0 0.000000
|
888 |
+
22 382 0 0.000000
|
889 |
+
22 384 0 0.000000
|
890 |
+
22 395 0 0.000000
|
891 |
+
22 410 0 0.000000
|
892 |
+
22 415 0 0.000000
|
893 |
+
22 429 0 0.000000
|
894 |
+
22 452 0 0.000000
|
895 |
+
22 466 0 0.000000
|
896 |
+
22 506 0 0.000000
|
897 |
+
22 513 0 0.000000
|
898 |
+
22 514 0 0.000000
|
899 |
+
22 526 0 0.000000
|
900 |
+
22 547 0 0.000000
|
901 |
+
22 568 0 0.000000
|
902 |
+
22 586 0 0.000000
|
903 |
+
22 588 0 0.000000
|
904 |
+
22 613 0 0.000000
|
905 |
+
22 619 0 0.000000
|
906 |
+
22 620 0 0.000000
|
907 |
+
22 624 0 0.000000
|
908 |
+
22 659 0 0.000000
|
909 |
+
22 790 0 0.000000
|
910 |
+
22 806 0 0.000000
|
911 |
+
22 810 0 0.000000
|
912 |
+
22 828 0 0.000000
|
913 |
+
22 883 0 0.000000
|
914 |
+
22 890 0 0.000000
|
915 |
+
22 986 0 0.000000
|
916 |
+
22 1051 0 0.000000
|
917 |
+
22 1303 0 0.000000
|
918 |
+
23 2 0 0.000000
|
919 |
+
23 9 0 0.000000
|
920 |
+
23 11 0 0.000000
|
921 |
+
23 23 0 0.000000
|
922 |
+
23 31 0 0.000000
|
923 |
+
23 36 0 0.000000
|
924 |
+
23 46 0 0.000000
|
925 |
+
23 115 0 0.000000
|
926 |
+
23 183 0 0.000000
|
927 |
+
23 184 0 0.000000
|
928 |
+
23 193 0 0.000000
|
929 |
+
23 201 0 0.000000
|
930 |
+
23 202 0 0.000000
|
931 |
+
23 203 0 0.000000
|
932 |
+
23 204 0 0.000000
|
933 |
+
23 205 0 0.000000
|
934 |
+
23 210 0 0.000000
|
935 |
+
23 234 0 0.000000
|
936 |
+
23 242 0 0.000000
|
937 |
+
23 282 0 0.000000
|
938 |
+
23 290 0 0.000000
|
939 |
+
23 294 0 0.000000
|
940 |
+
23 295 0 0.000000
|
941 |
+
23 323 0 0.000000
|
942 |
+
23 325 0 0.000000
|
943 |
+
23 358 0 0.000000
|
944 |
+
23 364 0 0.000000
|
945 |
+
23 367 0 0.000000
|
946 |
+
23 383 0 0.000000
|
947 |
+
23 394 0 0.000000
|
948 |
+
23 406 0 0.000000
|
949 |
+
23 433 0 0.000000
|
950 |
+
23 502 0 0.000000
|
951 |
+
23 624 0 0.000000
|
952 |
+
23 638 0 0.000000
|
953 |
+
23 772 0 0.000000
|
954 |
+
23 845 0 0.000000
|
955 |
+
23 916 0 0.000000
|
956 |
+
23 930 0 0.000000
|
957 |
+
23 943 0 0.000000
|
958 |
+
23 944 0 0.000000
|
959 |
+
23 952 0 0.000000
|
960 |
+
23 959 0 0.000000
|
961 |
+
23 963 0 0.000000
|
962 |
+
23 1361 0 0.000000
|
963 |
+
23 1418 0 0.000000
|
964 |
+
23 1445 0 0.000000
|
965 |
+
23 1451 0 0.000000
|
966 |
+
24 6 0 0.000000
|
967 |
+
24 8 0 0.000000
|
968 |
+
24 14 0 0.000000
|
969 |
+
24 22 0 0.000000
|
970 |
+
24 136 0 0.000000
|
971 |
+
24 141 0 0.000000
|
972 |
+
24 170 0 0.000000
|
973 |
+
24 171 0 0.000000
|
974 |
+
24 188 0 0.000000
|
975 |
+
24 197 0 0.000000
|
976 |
+
24 230 0 0.000000
|
977 |
+
24 231 0 0.000000
|
978 |
+
24 268 0 0.000000
|
979 |
+
24 325 0 0.000000
|
980 |
+
24 339 0 0.000000
|
981 |
+
24 344 0 0.000000
|
982 |
+
24 353 0 0.000000
|
983 |
+
24 387 0 0.000000
|
984 |
+
24 392 0 0.000000
|
985 |
+
24 405 0 0.000000
|
986 |
+
24 407 0 0.000000
|
987 |
+
24 413 0 0.000000
|
988 |
+
24 453 0 0.000000
|
989 |
+
24 556 0 0.000000
|
990 |
+
24 585 0 0.000000
|
991 |
+
24 598 0 0.000000
|
992 |
+
24 743 0 0.000000
|
993 |
+
24 832 0 0.000000
|
994 |
+
24 844 0 0.000000
|
995 |
+
24 857 0 0.000000
|
996 |
+
24 858 0 0.000000
|
997 |
+
24 891 0 0.000000
|
998 |
+
24 896 0 0.000000
|
999 |
+
24 923 0 0.000000
|
1000 |
+
24 924 0 0.000000
|
1001 |
+
24 929 0 0.000000
|
1002 |
+
24 934 0 0.000000
|
1003 |
+
24 935 0 0.000000
|
1004 |
+
24 945 0 0.000000
|
1005 |
+
24 949 0 0.000000
|
1006 |
+
24 1022 0 0.000000
|
1007 |
+
24 1147 0 0.000000
|
1008 |
+
24 1149 0 0.000000
|
1009 |
+
24 1166 0 0.000000
|
1010 |
+
24 1242 0 0.000000
|
1011 |
+
24 1245 0 0.000000
|
1012 |
+
24 1325 0 0.000000
|
1013 |
+
24 1356 0 0.000000
|
1014 |
+
24 1403 0 0.000000
|
1015 |
+
24 1423 0 0.000000
|
1016 |
+
24 1443 0 0.000000
|
1017 |
+
24 1457 0 0.000000
|
1018 |
+
25 12 0 0.000000
|
1019 |
+
25 17 0 0.000000
|
1020 |
+
25 94 0 0.000000
|
1021 |
+
25 130 0 0.000000
|
1022 |
+
25 138 0 0.000000
|
1023 |
+
25 243 0 0.000000
|
1024 |
+
25 260 0 0.000000
|
1025 |
+
25 323 0 0.000000
|
1026 |
+
25 342 0 0.000000
|
1027 |
+
25 375 0 0.000000
|
1028 |
+
25 376 0 0.000000
|
1029 |
+
25 384 0 0.000000
|
1030 |
+
25 452 0 0.000000
|
1031 |
+
25 482 0 0.000000
|
1032 |
+
25 529 0 0.000000
|
1033 |
+
25 710 0 0.000000
|
1034 |
+
25 873 0 0.000000
|
1035 |
+
25 877 0 0.000000
|
1036 |
+
25 919 0 0.000000
|
1037 |
+
25 1004 0 0.000000
|
1038 |
+
25 1095 0 0.000000
|
1039 |
+
25 1098 0 0.000000
|
1040 |
+
25 1153 0 0.000000
|
1041 |
+
25 1245 0 0.000000
|
1042 |
+
25 1251 0 0.000000
|
1043 |
+
25 1256 0 0.000000
|
1044 |
+
25 1303 0 0.000000
|
1045 |
+
25 1362 0 0.000000
|
1046 |
+
25 1431 0 0.000000
|
1047 |
+
25 1433 0 0.000000
|
1048 |
+
25 1435 0 0.000000
|
1049 |
+
25 1436 0 0.000000
|
1050 |
+
25 1441 0 0.000000
|
1051 |
+
26 17 0 0.000000
|
1052 |
+
26 27 0 0.000000
|
1053 |
+
26 36 0 0.000000
|
1054 |
+
26 67 0 0.000000
|
1055 |
+
26 74 0 0.000000
|
1056 |
+
26 83 0 0.000000
|
1057 |
+
26 126 0 0.000000
|
1058 |
+
26 158 0 0.000000
|
1059 |
+
26 164 0 0.000000
|
1060 |
+
26 192 0 0.000000
|
1061 |
+
26 214 0 0.000000
|
1062 |
+
26 218 0 0.000000
|
1063 |
+
26 307 0 0.000000
|
1064 |
+
26 338 0 0.000000
|
1065 |
+
26 364 0 0.000000
|
1066 |
+
26 365 0 0.000000
|
1067 |
+
26 372 0 0.000000
|
1068 |
+
26 381 0 0.000000
|
1069 |
+
26 446 0 0.000000
|
1070 |
+
26 458 0 0.000000
|
1071 |
+
26 465 0 0.000000
|
1072 |
+
26 468 0 0.000000
|
1073 |
+
26 474 0 0.000000
|
1074 |
+
26 490 0 0.000000
|
1075 |
+
26 491 0 0.000000
|
1076 |
+
26 495 0 0.000000
|
1077 |
+
26 496 0 0.000000
|
1078 |
+
26 497 0 0.000000
|
1079 |
+
26 500 0 0.000000
|
1080 |
+
26 507 0 0.000000
|
1081 |
+
26 523 0 0.000000
|
1082 |
+
26 534 0 0.000000
|
1083 |
+
26 584 0 0.000000
|
1084 |
+
26 591 0 0.000000
|
1085 |
+
26 615 0 0.000000
|
1086 |
+
26 620 0 0.000000
|
1087 |
+
26 639 0 0.000000
|
1088 |
+
26 675 0 0.000000
|
1089 |
+
26 690 0 0.000000
|
1090 |
+
26 723 0 0.000000
|
1091 |
+
26 732 0 0.000000
|
1092 |
+
26 779 0 0.000000
|
1093 |
+
26 813 0 0.000000
|
1094 |
+
26 822 0 0.000000
|
1095 |
+
26 848 0 0.000000
|
1096 |
+
26 849 0 0.000000
|
1097 |
+
26 860 0 0.000000
|
1098 |
+
26 865 0 0.000000
|
1099 |
+
26 979 0 0.000000
|
1100 |
+
26 1100 0 0.000000
|
1101 |
+
26 1264 0 0.000000
|
1102 |
+
26 1366 0 0.000000
|
1103 |
+
26 1368 0 0.000000
|
1104 |
+
26 1374 0 0.000000
|
1105 |
+
26 1376 0 0.000000
|
1106 |
+
26 1377 0 0.000000
|
1107 |
+
27 27 0 0.000000
|
1108 |
+
27 44 0 0.000000
|
1109 |
+
27 51 0 0.000000
|
1110 |
+
27 52 0 0.000000
|
1111 |
+
27 57 0 0.000000
|
1112 |
+
27 65 0 0.000000
|
1113 |
+
27 68 0 0.000000
|
1114 |
+
27 71 0 0.000000
|
1115 |
+
27 72 0 0.000000
|
1116 |
+
27 77 0 0.000000
|
1117 |
+
27 78 0 0.000000
|
1118 |
+
27 79 0 0.000000
|
1119 |
+
27 114 0 0.000000
|
1120 |
+
27 117 0 0.000000
|
1121 |
+
27 123 0 0.000000
|
1122 |
+
27 126 0 0.000000
|
1123 |
+
27 149 0 0.000000
|
1124 |
+
27 150 0 0.000000
|
1125 |
+
27 159 0 0.000000
|
1126 |
+
27 174 0 0.000000
|
1127 |
+
27 175 0 0.000000
|
1128 |
+
27 176 0 0.000000
|
1129 |
+
27 180 0 0.000000
|
1130 |
+
27 187 0 0.000000
|
1131 |
+
27 190 0 0.000000
|
1132 |
+
27 191 0 0.000000
|
1133 |
+
27 212 0 0.000000
|
1134 |
+
27 241 0 0.000000
|
1135 |
+
27 257 0 0.000000
|
1136 |
+
27 258 0 0.000000
|
1137 |
+
27 259 0 0.000000
|
1138 |
+
27 309 0 0.000000
|
1139 |
+
27 314 0 0.000000
|
1140 |
+
27 315 0 0.000000
|
1141 |
+
27 319 0 0.000000
|
1142 |
+
27 321 0 0.000000
|
1143 |
+
27 326 0 0.000000
|
1144 |
+
27 327 0 0.000000
|
1145 |
+
27 329 0 0.000000
|
1146 |
+
27 377 0 0.000000
|
1147 |
+
27 378 0 0.000000
|
1148 |
+
27 389 0 0.000000
|
1149 |
+
27 390 0 0.000000
|
1150 |
+
27 434 0 0.000000
|
1151 |
+
27 446 0 0.000000
|
1152 |
+
27 448 0 0.000000
|
1153 |
+
27 480 0 0.000000
|
1154 |
+
27 489 0 0.000000
|
1155 |
+
27 493 0 0.000000
|
1156 |
+
27 499 0 0.000000
|
1157 |
+
27 500 0 0.000000
|
1158 |
+
27 506 0 0.000000
|
1159 |
+
27 510 0 0.000000
|
1160 |
+
27 517 0 0.000000
|
1161 |
+
27 522 0 0.000000
|
1162 |
+
27 527 0 0.000000
|
1163 |
+
27 530 0 0.000000
|
1164 |
+
27 531 0 0.000000
|
1165 |
+
27 538 0 0.000000
|
1166 |
+
27 565 0 0.000000
|
1167 |
+
27 566 0 0.000000
|
1168 |
+
27 570 0 0.000000
|
1169 |
+
27 590 0 0.000000
|
1170 |
+
27 600 0 0.000000
|
1171 |
+
27 603 0 0.000000
|
1172 |
+
27 632 0 0.000000
|
1173 |
+
27 644 0 0.000000
|
1174 |
+
27 659 0 0.000000
|
1175 |
+
27 670 0 0.000000
|
1176 |
+
27 671 0 0.000000
|
1177 |
+
27 673 0 0.000000
|
1178 |
+
27 680 0 0.000000
|
1179 |
+
27 684 0 0.000000
|
1180 |
+
27 687 0 0.000000
|
1181 |
+
27 695 0 0.000000
|
1182 |
+
27 699 0 0.000000
|
1183 |
+
27 700 0 0.000000
|
1184 |
+
27 704 0 0.000000
|
1185 |
+
27 709 0 0.000000
|
1186 |
+
27 740 0 0.000000
|
1187 |
+
27 746 0 0.000000
|
1188 |
+
27 758 0 0.000000
|
1189 |
+
27 761 0 0.000000
|
1190 |
+
27 769 0 0.000000
|
1191 |
+
27 773 0 0.000000
|
1192 |
+
27 776 0 0.000000
|
1193 |
+
27 781 0 0.000000
|
1194 |
+
27 790 0 0.000000
|
1195 |
+
27 796 0 0.000000
|
1196 |
+
27 805 0 0.000000
|
1197 |
+
27 817 0 0.000000
|
1198 |
+
27 820 0 0.000000
|
1199 |
+
27 824 0 0.000000
|
1200 |
+
27 825 0 0.000000
|
1201 |
+
27 830 0 0.000000
|
1202 |
+
27 869 0 0.000000
|
1203 |
+
27 894 0 0.000000
|
1204 |
+
27 1091 0 0.000000
|
1205 |
+
27 1120 0 0.000000
|
1206 |
+
27 1124 0 0.000000
|
1207 |
+
27 1126 0 0.000000
|
1208 |
+
27 1127 0 0.000000
|
1209 |
+
27 1130 0 0.000000
|
1210 |
+
27 1132 0 0.000000
|
1211 |
+
27 1139 0 0.000000
|
1212 |
+
27 1144 0 0.000000
|
1213 |
+
27 1230 0 0.000000
|
1214 |
+
27 1255 0 0.000000
|
1215 |
+
27 1280 0 0.000000
|
1216 |
+
27 1283 0 0.000000
|
1217 |
+
27 1298 0 0.000000
|
1218 |
+
27 1323 0 0.000000
|
1219 |
+
27 1392 0 0.000000
|
1220 |
+
27 1419 0 0.000000
|
1221 |
+
27 1421 0 0.000000
|
1222 |
+
28 116 0 0.000000
|
1223 |
+
28 133 0 0.000000
|
1224 |
+
28 150 0 0.000000
|
1225 |
+
28 156 0 0.000000
|
1226 |
+
28 164 0 0.000000
|
1227 |
+
28 198 0 0.000000
|
1228 |
+
28 243 0 0.000000
|
1229 |
+
28 252 0 0.000000
|
1230 |
+
28 327 0 0.000000
|
1231 |
+
28 375 0 0.000000
|
1232 |
+
28 460 0 0.000000
|
1233 |
+
28 465 0 0.000000
|
1234 |
+
28 568 0 0.000000
|
1235 |
+
28 569 0 0.000000
|
1236 |
+
28 582 0 0.000000
|
1237 |
+
28 609 0 0.000000
|
1238 |
+
28 635 0 0.000000
|
1239 |
+
28 670 0 0.000000
|
1240 |
+
28 671 0 0.000000
|
1241 |
+
28 674 0 0.000000
|
1242 |
+
28 676 0 0.000000
|
1243 |
+
28 681 0 0.000000
|
1244 |
+
28 683 0 0.000000
|
1245 |
+
28 684 0 0.000000
|
1246 |
+
28 687 0 0.000000
|
1247 |
+
28 689 0 0.000000
|
1248 |
+
28 690 0 0.000000
|
1249 |
+
28 692 0 0.000000
|
1250 |
+
28 695 0 0.000000
|
1251 |
+
28 696 0 0.000000
|
1252 |
+
28 699 0 0.000000
|
1253 |
+
28 700 0 0.000000
|
1254 |
+
28 702 0 0.000000
|
1255 |
+
28 703 0 0.000000
|
1256 |
+
28 704 0 0.000000
|
1257 |
+
28 707 0 0.000000
|
1258 |
+
28 709 0 0.000000
|
1259 |
+
28 710 0 0.000000
|
1260 |
+
28 722 0 0.000000
|
1261 |
+
28 723 0 0.000000
|
1262 |
+
28 726 0 0.000000
|
1263 |
+
28 731 0 0.000000
|
1264 |
+
28 741 0 0.000000
|
1265 |
+
28 742 0 0.000000
|
1266 |
+
28 743 0 0.000000
|
1267 |
+
28 813 0 0.000000
|
1268 |
+
28 833 0 0.000000
|
1269 |
+
28 890 0 0.000000
|
1270 |
+
28 1026 0 0.000000
|
1271 |
+
28 1089 0 0.000000
|
1272 |
+
28 1092 0 0.000000
|
1273 |
+
28 1120 0 0.000000
|
1274 |
+
28 1126 0 0.000000
|
1275 |
+
28 1162 0 0.000000
|
1276 |
+
28 1164 0 0.000000
|
1277 |
+
28 1180 0 0.000000
|
1278 |
+
28 1292 0 0.000000
|
1279 |
+
28 1296 0 0.000000
|
1280 |
+
28 1370 0 0.000000
|
1281 |
+
28 1460 0 0.000000
|
1282 |
+
29 34 0 0.000000
|
1283 |
+
29 65 0 0.000000
|
1284 |
+
29 68 0 0.000000
|
1285 |
+
29 71 0 0.000000
|
1286 |
+
29 72 0 0.000000
|
1287 |
+
29 77 0 0.000000
|
1288 |
+
29 78 0 0.000000
|
1289 |
+
29 79 0 0.000000
|
1290 |
+
29 90 0 0.000000
|
1291 |
+
29 117 0 0.000000
|
1292 |
+
29 156 0 0.000000
|
1293 |
+
29 159 0 0.000000
|
1294 |
+
29 175 0 0.000000
|
1295 |
+
29 176 0 0.000000
|
1296 |
+
29 194 0 0.000000
|
1297 |
+
29 195 0 0.000000
|
1298 |
+
29 212 0 0.000000
|
1299 |
+
29 257 0 0.000000
|
1300 |
+
29 315 0 0.000000
|
1301 |
+
29 377 0 0.000000
|
1302 |
+
29 446 0 0.000000
|
1303 |
+
29 493 0 0.000000
|
1304 |
+
29 499 0 0.000000
|
1305 |
+
29 503 0 0.000000
|
1306 |
+
29 517 0 0.000000
|
1307 |
+
29 527 0 0.000000
|
1308 |
+
29 531 0 0.000000
|
1309 |
+
29 643 0 0.000000
|
1310 |
+
29 649 0 0.000000
|
1311 |
+
29 650 0 0.000000
|
1312 |
+
29 660 0 0.000000
|
1313 |
+
29 661 0 0.000000
|
1314 |
+
29 671 0 0.000000
|
1315 |
+
29 673 0 0.000000
|
1316 |
+
29 674 0 0.000000
|
1317 |
+
29 680 0 0.000000
|
1318 |
+
29 699 0 0.000000
|
1319 |
+
29 700 0 0.000000
|
1320 |
+
29 704 0 0.000000
|
1321 |
+
29 709 0 0.000000
|
1322 |
+
29 713 0 0.000000
|
1323 |
+
29 715 0 0.000000
|
1324 |
+
29 807 0 0.000000
|
1325 |
+
29 830 0 0.000000
|
1326 |
+
29 1144 0 0.000000
|
1327 |
+
29 1280 0 0.000000
|
1328 |
+
29 1419 0 0.000000
|
1329 |
+
29 1421 0 0.000000
|
1330 |
+
30 2 0 0.000000
|
1331 |
+
30 10 0 0.000000
|
1332 |
+
30 15 0 0.000000
|
1333 |
+
30 37 0 0.000000
|
1334 |
+
30 63 0 0.000000
|
1335 |
+
30 76 0 0.000000
|
1336 |
+
30 77 0 0.000000
|
1337 |
+
30 87 0 0.000000
|
1338 |
+
30 89 0 0.000000
|
1339 |
+
30 97 0 0.000000
|
1340 |
+
30 102 0 0.000000
|
1341 |
+
30 111 0 0.000000
|
1342 |
+
30 112 0 0.000000
|
1343 |
+
30 121 0 0.000000
|
1344 |
+
30 138 0 0.000000
|
1345 |
+
30 166 0 0.000000
|
1346 |
+
30 167 0 0.000000
|
1347 |
+
30 213 0 0.000000
|
1348 |
+
30 215 0 0.000000
|
1349 |
+
30 219 0 0.000000
|
1350 |
+
30 225 0 0.000000
|
1351 |
+
30 234 0 0.000000
|
1352 |
+
30 255 0 0.000000
|
1353 |
+
30 311 0 0.000000
|
1354 |
+
30 323 0 0.000000
|
1355 |
+
30 341 0 0.000000
|
1356 |
+
30 362 0 0.000000
|
1357 |
+
30 379 0 0.000000
|
1358 |
+
30 573 0 0.000000
|
1359 |
+
30 580 0 0.000000
|
1360 |
+
30 587 0 0.000000
|
1361 |
+
30 588 0 0.000000
|
1362 |
+
30 605 0 0.000000
|
1363 |
+
30 611 0 0.000000
|
1364 |
+
30 613 0 0.000000
|
1365 |
+
30 614 0 0.000000
|
1366 |
+
30 616 0 0.000000
|
1367 |
+
30 618 0 0.000000
|
1368 |
+
30 622 0 0.000000
|
1369 |
+
30 632 0 0.000000
|
1370 |
+
30 635 0 0.000000
|
1371 |
+
30 638 0 0.000000
|
1372 |
+
30 656 0 0.000000
|
1373 |
+
30 685 0 0.000000
|
1374 |
+
30 686 0 0.000000
|
1375 |
+
30 691 0 0.000000
|
1376 |
+
30 721 0 0.000000
|
1377 |
+
30 724 0 0.000000
|
1378 |
+
30 725 0 0.000000
|
1379 |
+
30 741 0 0.000000
|
1380 |
+
30 744 0 0.000000
|
1381 |
+
30 747 0 0.000000
|
1382 |
+
30 748 0 0.000000
|
1383 |
+
30 750 0 0.000000
|
1384 |
+
30 751 0 0.000000
|
1385 |
+
30 756 0 0.000000
|
1386 |
+
30 757 0 0.000000
|
1387 |
+
30 759 0 0.000000
|
1388 |
+
30 764 0 0.000000
|
1389 |
+
30 765 0 0.000000
|
1390 |
+
30 766 0 0.000000
|
1391 |
+
30 767 0 0.000000
|
1392 |
+
30 770 0 0.000000
|
1393 |
+
30 775 0 0.000000
|
1394 |
+
30 777 0 0.000000
|
1395 |
+
30 778 0 0.000000
|
1396 |
+
30 782 0 0.000000
|
1397 |
+
30 784 0 0.000000
|
1398 |
+
30 786 0 0.000000
|
1399 |
+
30 787 0 0.000000
|
1400 |
+
30 788 0 0.000000
|
1401 |
+
30 789 0 0.000000
|
1402 |
+
30 791 0 0.000000
|
1403 |
+
30 793 0 0.000000
|
1404 |
+
30 794 0 0.000000
|
1405 |
+
30 800 0 0.000000
|
1406 |
+
30 804 0 0.000000
|
1407 |
+
30 808 0 0.000000
|
1408 |
+
30 821 0 0.000000
|
1409 |
+
30 831 0 0.000000
|
1410 |
+
30 953 0 0.000000
|
1411 |
+
30 958 0 0.000000
|
1412 |
+
30 1055 0 0.000000
|
1413 |
+
30 1085 0 0.000000
|
1414 |
+
30 1086 0 0.000000
|
1415 |
+
30 1090 0 0.000000
|
1416 |
+
30 1097 0 0.000000
|
1417 |
+
30 1108 0 0.000000
|
1418 |
+
30 1109 0 0.000000
|
1419 |
+
30 1113 0 0.000000
|
1420 |
+
30 1114 0 0.000000
|
1421 |
+
30 1115 0 0.000000
|
1422 |
+
30 1122 0 0.000000
|
1423 |
+
30 1123 0 0.000000
|
1424 |
+
30 1155 0 0.000000
|
1425 |
+
30 1156 0 0.000000
|
1426 |
+
30 1157 0 0.000000
|
1427 |
+
30 1161 0 0.000000
|
1428 |
+
30 1167 0 0.000000
|
1429 |
+
30 1168 0 0.000000
|
1430 |
+
30 1172 0 0.000000
|
1431 |
+
30 1173 0 0.000000
|
1432 |
+
30 1176 0 0.000000
|
1433 |
+
30 1182 0 0.000000
|
1434 |
+
30 1190 0 0.000000
|
1435 |
+
30 1191 0 0.000000
|
1436 |
+
30 1209 0 0.000000
|
1437 |
+
30 1210 0 0.000000
|
1438 |
+
30 1241 0 0.000000
|
1439 |
+
30 1254 0 0.000000
|
1440 |
+
30 1260 0 0.000000
|
1441 |
+
30 1269 0 0.000000
|
1442 |
+
30 1274 0 0.000000
|
1443 |
+
30 1276 0 0.000000
|
1444 |
+
30 1278 0 0.000000
|
1445 |
+
30 1279 0 0.000000
|
1446 |
+
30 1284 0 0.000000
|
1447 |
+
30 1285 0 0.000000
|
1448 |
+
30 1286 0 0.000000
|
1449 |
+
30 1287 0 0.000000
|
1450 |
+
30 1289 0 0.000000
|
1451 |
+
30 1290 0 0.000000
|
1452 |
+
30 1301 0 0.000000
|
1453 |
+
30 1304 0 0.000000
|
1454 |
+
30 1313 0 0.000000
|
1455 |
+
30 1319 0 0.000000
|
1456 |
+
30 1335 0 0.000000
|
1457 |
+
30 1350 0 0.000000
|
1458 |
+
30 1369 0 0.000000
|
1459 |
+
30 1418 0 0.000000
|
1460 |
+
30 1428 0 0.000000
|
1461 |
+
30 1432 0 0.000000
|
1462 |
+
30 1444 0 0.000000
|
1463 |
+
30 1451 0 0.000000
|
1464 |
+
31 95 0 0.000000
|
1465 |
+
31 116 0 0.000000
|
1466 |
+
31 131 0 0.000000
|
1467 |
+
31 133 0 0.000000
|
1468 |
+
31 145 0 0.000000
|
1469 |
+
31 150 0 0.000000
|
1470 |
+
31 156 0 0.000000
|
1471 |
+
31 375 0 0.000000
|
1472 |
+
31 379 0 0.000000
|
1473 |
+
31 460 0 0.000000
|
1474 |
+
31 465 0 0.000000
|
1475 |
+
31 473 0 0.000000
|
1476 |
+
31 482 0 0.000000
|
1477 |
+
31 485 0 0.000000
|
1478 |
+
31 503 0 0.000000
|
1479 |
+
31 535 0 0.000000
|
1480 |
+
31 569 0 0.000000
|
1481 |
+
31 576 0 0.000000
|
1482 |
+
31 614 0 0.000000
|
1483 |
+
31 635 0 0.000000
|
1484 |
+
31 638 0 0.000000
|
1485 |
+
31 670 0 0.000000
|
1486 |
+
31 674 0 0.000000
|
1487 |
+
31 681 0 0.000000
|
1488 |
+
31 682 0 0.000000
|
1489 |
+
31 683 0 0.000000
|
1490 |
+
31 687 0 0.000000
|
1491 |
+
31 689 0 0.000000
|
1492 |
+
31 690 0 0.000000
|
1493 |
+
31 692 0 0.000000
|
1494 |
+
31 695 0 0.000000
|
1495 |
+
31 702 0 0.000000
|
1496 |
+
31 703 0 0.000000
|
1497 |
+
31 707 0 0.000000
|
1498 |
+
31 709 0 0.000000
|
1499 |
+
31 710 0 0.000000
|
1500 |
+
31 741 0 0.000000
|
1501 |
+
31 742 0 0.000000
|
1502 |
+
31 743 0 0.000000
|
1503 |
+
31 744 0 0.000000
|
1504 |
+
31 763 0 0.000000
|
1505 |
+
31 773 0 0.000000
|
1506 |
+
31 775 0 0.000000
|
1507 |
+
31 820 0 0.000000
|
1508 |
+
31 889 0 0.000000
|
1509 |
+
31 1080 0 0.000000
|
1510 |
+
31 1112 0 0.000000
|
1511 |
+
31 1121 0 0.000000
|
1512 |
+
31 1124 0 0.000000
|
1513 |
+
31 1126 0 0.000000
|
1514 |
+
31 1180 0 0.000000
|
1515 |
+
31 1207 0 0.000000
|
1516 |
+
31 1208 0 0.000000
|
1517 |
+
31 1256 0 0.000000
|
1518 |
+
31 1264 0 0.000000
|
1519 |
+
31 1296 0 0.000000
|
1520 |
+
31 1299 0 0.000000
|
1521 |
+
31 1303 0 0.000000
|
1522 |
+
31 1370 0 0.000000
|
1523 |
+
31 1436 0 0.000000
|
1524 |
+
31 1460 0 0.000000
|
1525 |
+
32 11 0 0.000000
|
1526 |
+
32 17 0 0.000000
|
1527 |
+
32 35 0 0.000000
|
1528 |
+
32 36 0 0.000000
|
1529 |
+
32 56 0 0.000000
|
1530 |
+
32 92 0 0.000000
|
1531 |
+
32 178 0 0.000000
|
1532 |
+
32 192 0 0.000000
|
1533 |
+
32 193 0 0.000000
|
1534 |
+
32 195 0 0.000000
|
1535 |
+
32 196 0 0.000000
|
1536 |
+
32 200 0 0.000000
|
1537 |
+
32 201 0 0.000000
|
1538 |
+
32 212 0 0.000000
|
1539 |
+
32 219 0 0.000000
|
1540 |
+
32 243 0 0.000000
|
1541 |
+
32 244 0 0.000000
|
1542 |
+
32 246 0 0.000000
|
1543 |
+
32 248 0 0.000000
|
1544 |
+
32 250 0 0.000000
|
1545 |
+
32 257 0 0.000000
|
1546 |
+
32 258 0 0.000000
|
1547 |
+
32 259 0 0.000000
|
1548 |
+
32 262 0 0.000000
|
1549 |
+
32 267 0 0.000000
|
1550 |
+
32 269 0 0.000000
|
1551 |
+
32 277 0 0.000000
|
1552 |
+
32 287 0 0.000000
|
1553 |
+
32 289 0 0.000000
|
1554 |
+
32 291 0 0.000000
|
1555 |
+
32 294 0 0.000000
|
1556 |
+
32 299 0 0.000000
|
1557 |
+
32 307 0 0.000000
|
1558 |
+
32 314 0 0.000000
|
1559 |
+
32 323 0 0.000000
|
1560 |
+
32 326 0 0.000000
|
1561 |
+
32 331 0 0.000000
|
1562 |
+
32 333 0 0.000000
|
1563 |
+
32 336 0 0.000000
|
1564 |
+
32 338 0 0.000000
|
1565 |
+
32 348 0 0.000000
|
1566 |
+
32 374 0 0.000000
|
1567 |
+
32 375 0 0.000000
|
1568 |
+
32 388 0 0.000000
|
1569 |
+
32 406 0 0.000000
|
1570 |
+
32 408 0 0.000000
|
1571 |
+
32 409 0 0.000000
|
1572 |
+
32 410 0 0.000000
|
1573 |
+
32 548 0 0.000000
|
1574 |
+
32 593 0 0.000000
|
1575 |
+
32 597 0 0.000000
|
1576 |
+
32 660 0 0.000000
|
1577 |
+
32 664 0 0.000000
|
1578 |
+
32 722 0 0.000000
|
1579 |
+
32 724 0 0.000000
|
1580 |
+
32 726 0 0.000000
|
1581 |
+
32 728 0 0.000000
|
1582 |
+
32 734 0 0.000000
|
1583 |
+
32 836 0 0.000000
|
1584 |
+
32 848 0 0.000000
|
1585 |
+
32 849 0 0.000000
|
1586 |
+
32 850 0 0.000000
|
1587 |
+
32 854 0 0.000000
|
1588 |
+
32 856 0 0.000000
|
1589 |
+
32 858 0 0.000000
|
1590 |
+
32 861 0 0.000000
|
1591 |
+
32 863 0 0.000000
|
1592 |
+
32 872 0 0.000000
|
1593 |
+
32 874 0 0.000000
|
1594 |
+
32 875 0 0.000000
|
1595 |
+
32 880 0 0.000000
|
1596 |
+
32 884 0 0.000000
|
1597 |
+
32 885 0 0.000000
|
1598 |
+
32 886 0 0.000000
|
1599 |
+
32 887 0 0.000000
|
1600 |
+
32 916 0 0.000000
|
1601 |
+
32 917 0 0.000000
|
1602 |
+
32 921 0 0.000000
|
1603 |
+
32 922 0 0.000000
|
1604 |
+
32 925 0 0.000000
|
1605 |
+
32 941 0 0.000000
|
1606 |
+
32 947 0 0.000000
|
1607 |
+
32 955 0 0.000000
|
1608 |
+
32 963 0 0.000000
|
1609 |
+
32 970 0 0.000000
|
1610 |
+
32 979 0 0.000000
|
1611 |
+
32 990 0 0.000000
|
1612 |
+
32 997 0 0.000000
|
1613 |
+
32 998 0 0.000000
|
1614 |
+
32 1012 0 0.000000
|
1615 |
+
32 1042 0 0.000000
|
1616 |
+
32 1043 0 0.000000
|
1617 |
+
32 1079 0 0.000000
|
1618 |
+
32 1193 0 0.000000
|
1619 |
+
32 1196 0 0.000000
|
1620 |
+
32 1197 0 0.000000
|
1621 |
+
32 1198 0 0.000000
|
1622 |
+
32 1229 0 0.000000
|
1623 |
+
32 1230 0 0.000000
|
1624 |
+
32 1248 0 0.000000
|
1625 |
+
32 1252 0 0.000000
|
1626 |
+
32 1264 0 0.000000
|
1627 |
+
32 1280 0 0.000000
|
1628 |
+
32 1351 0 0.000000
|
1629 |
+
32 1358 0 0.000000
|
1630 |
+
32 1366 0 0.000000
|
1631 |
+
32 1367 0 0.000000
|
1632 |
+
32 1368 0 0.000000
|
1633 |
+
32 1371 0 0.000000
|
1634 |
+
32 1372 0 0.000000
|
1635 |
+
32 1375 0 0.000000
|
1636 |
+
32 1376 0 0.000000
|
1637 |
+
32 1377 0 0.000000
|
1638 |
+
32 1410 0 0.000000
|
1639 |
+
32 1415 0 0.000000
|
1640 |
+
32 1418 0 0.000000
|
1641 |
+
32 1445 0 0.000000
|
1642 |
+
33 122 0 0.000000
|
1643 |
+
33 123 0 0.000000
|
1644 |
+
33 169 0 0.000000
|
1645 |
+
33 375 0 0.000000
|
1646 |
+
33 376 0 0.000000
|
1647 |
+
33 854 0 0.000000
|
1648 |
+
33 885 0 0.000000
|
1649 |
+
33 947 0 0.000000
|
1650 |
+
33 980 0 0.000000
|
1651 |
+
33 997 0 0.000000
|
1652 |
+
33 1011 0 0.000000
|
1653 |
+
33 1013 0 0.000000
|
1654 |
+
33 1121 0 0.000000
|
1655 |
+
33 1146 0 0.000000
|
1656 |
+
33 1171 0 0.000000
|
1657 |
+
33 1198 0 0.000000
|
1658 |
+
33 1303 0 0.000000
|
1659 |
+
33 1367 0 0.000000
|
1660 |
+
33 1377 0 0.000000
|
1661 |
+
33 1410 0 0.000000
|
1662 |
+
34 34 0 0.000000
|
1663 |
+
34 44 0 0.000000
|
1664 |
+
34 53 0 0.000000
|
1665 |
+
34 57 0 0.000000
|
1666 |
+
34 68 0 0.000000
|
1667 |
+
34 80 0 0.000000
|
1668 |
+
34 117 0 0.000000
|
1669 |
+
34 123 0 0.000000
|
1670 |
+
34 159 0 0.000000
|
1671 |
+
34 320 0 0.000000
|
1672 |
+
34 377 0 0.000000
|
1673 |
+
34 434 0 0.000000
|
1674 |
+
34 489 0 0.000000
|
1675 |
+
34 493 0 0.000000
|
1676 |
+
34 522 0 0.000000
|
1677 |
+
34 530 0 0.000000
|
1678 |
+
34 600 0 0.000000
|
1679 |
+
34 668 0 0.000000
|
1680 |
+
34 669 0 0.000000
|
1681 |
+
34 670 0 0.000000
|
1682 |
+
34 671 0 0.000000
|
1683 |
+
34 673 0 0.000000
|
1684 |
+
34 677 0 0.000000
|
1685 |
+
34 678 0 0.000000
|
1686 |
+
34 679 0 0.000000
|
1687 |
+
34 681 0 0.000000
|
1688 |
+
34 687 0 0.000000
|
1689 |
+
34 689 0 0.000000
|
1690 |
+
34 694 0 0.000000
|
1691 |
+
34 697 0 0.000000
|
1692 |
+
34 699 0 0.000000
|
1693 |
+
34 700 0 0.000000
|
1694 |
+
34 704 0 0.000000
|
1695 |
+
34 706 0 0.000000
|
1696 |
+
34 708 0 0.000000
|
1697 |
+
34 709 0 0.000000
|
1698 |
+
34 830 0 0.000000
|
1699 |
+
34 1144 0 0.000000
|
1700 |
+
35 12 0 0.000000
|
1701 |
+
35 18 0 0.000000
|
1702 |
+
35 54 0 0.000000
|
1703 |
+
35 75 0 0.000000
|
1704 |
+
35 92 0 0.000000
|
1705 |
+
35 119 0 0.000000
|
1706 |
+
35 126 0 0.000000
|
1707 |
+
35 130 0 0.000000
|
1708 |
+
35 156 0 0.000000
|
1709 |
+
35 163 0 0.000000
|
1710 |
+
35 178 0 0.000000
|
1711 |
+
35 220 0 0.000000
|
1712 |
+
35 286 0 0.000000
|
1713 |
+
35 355 0 0.000000
|
1714 |
+
35 376 0 0.000000
|
1715 |
+
35 385 0 0.000000
|
1716 |
+
35 402 0 0.000000
|
1717 |
+
35 403 0 0.000000
|
1718 |
+
35 404 0 0.000000
|
1719 |
+
35 406 0 0.000000
|
1720 |
+
35 452 0 0.000000
|
1721 |
+
35 466 0 0.000000
|
1722 |
+
35 496 0 0.000000
|
1723 |
+
35 514 0 0.000000
|
1724 |
+
35 527 0 0.000000
|
1725 |
+
35 537 0 0.000000
|
1726 |
+
35 547 0 0.000000
|
1727 |
+
35 619 0 0.000000
|
1728 |
+
35 687 0 0.000000
|
1729 |
+
35 694 0 0.000000
|
1730 |
+
35 707 0 0.000000
|
1731 |
+
35 730 0 0.000000
|
1732 |
+
35 837 0 0.000000
|
1733 |
+
35 978 0 0.000000
|
1734 |
+
35 1080 0 0.000000
|
1735 |
+
35 1143 0 0.000000
|
1736 |
+
35 1145 0 0.000000
|
1737 |
+
35 1146 0 0.000000
|
1738 |
+
35 1207 0 0.000000
|
1739 |
+
35 1208 0 0.000000
|
1740 |
+
35 1264 0 0.000000
|
1741 |
+
35 1288 0 0.000000
|
1742 |
+
35 1360 0 0.000000
|
1743 |
+
37 1 0 0.000000
|
1744 |
+
37 16 0 0.000000
|
1745 |
+
37 30 0 0.000000
|
1746 |
+
37 34 0 0.000000
|
1747 |
+
37 38 0 0.000000
|
1748 |
+
37 44 0 0.000000
|
1749 |
+
37 51 0 0.000000
|
1750 |
+
37 52 0 0.000000
|
1751 |
+
37 53 0 0.000000
|
1752 |
+
37 69 0 0.000000
|
1753 |
+
37 71 0 0.000000
|
1754 |
+
37 75 0 0.000000
|
1755 |
+
37 79 0 0.000000
|
1756 |
+
37 151 0 0.000000
|
1757 |
+
37 194 0 0.000000
|
1758 |
+
37 653 0 0.000000
|
1759 |
+
37 687 0 0.000000
|
1760 |
+
37 688 0 0.000000
|
1761 |
+
37 701 0 0.000000
|
1762 |
+
37 732 0 0.000000
|
1763 |
+
37 773 0 0.000000
|
1764 |
+
37 781 0 0.000000
|
1765 |
+
37 798 0 0.000000
|
1766 |
+
37 802 0 0.000000
|
1767 |
+
37 809 0 0.000000
|
1768 |
+
37 989 0 0.000000
|
1769 |
+
37 1073 0 0.000000
|
1770 |
+
37 1091 0 0.000000
|
1771 |
+
37 1118 0 0.000000
|
1772 |
+
37 1124 0 0.000000
|
1773 |
+
37 1131 0 0.000000
|
1774 |
+
37 1133 0 0.000000
|
1775 |
+
37 1144 0 0.000000
|
1776 |
+
37 1163 0 0.000000
|
1777 |
+
37 1171 0 0.000000
|
1778 |
+
37 1222 0 0.000000
|
1779 |
+
37 1326 0 0.000000
|
1780 |
+
37 1413 0 0.000000
|
1781 |
+
37 1414 0 0.000000
|
1782 |
+
37 1448 0 0.000000
|
1783 |
+
39 6 0 0.000000
|
1784 |
+
39 14 0 0.000000
|
1785 |
+
39 22 0 0.000000
|
1786 |
+
39 93 0 0.000000
|
1787 |
+
39 114 0 0.000000
|
1788 |
+
39 141 0 0.000000
|
1789 |
+
39 272 0 0.000000
|
1790 |
+
39 323 0 0.000000
|
1791 |
+
39 371 0 0.000000
|
1792 |
+
39 387 0 0.000000
|
1793 |
+
39 598 0 0.000000
|
1794 |
+
39 839 0 0.000000
|
1795 |
+
39 881 0 0.000000
|
1796 |
+
39 896 0 0.000000
|
1797 |
+
39 1022 0 0.000000
|
1798 |
+
39 1166 0 0.000000
|
1799 |
+
39 1178 0 0.000000
|
1800 |
+
39 1248 0 0.000000
|
1801 |
+
41 34 0 0.000000
|
1802 |
+
41 86 0 0.000000
|
1803 |
+
41 388 0 0.000000
|
1804 |
+
41 488 0 0.000000
|
1805 |
+
41 669 0 0.000000
|
1806 |
+
41 687 0 0.000000
|
1807 |
+
41 795 0 0.000000
|
1808 |
+
41 825 0 0.000000
|
1809 |
+
41 966 0 0.000000
|
1810 |
+
41 1066 0 0.000000
|
1811 |
+
41 1395 0 0.000000
|
1812 |
+
42 29 0 0.000000
|
1813 |
+
42 60 0 0.000000
|
1814 |
+
42 85 0 0.000000
|
1815 |
+
42 92 0 0.000000
|
1816 |
+
42 114 0 0.000000
|
1817 |
+
42 123 0 0.000000
|
1818 |
+
42 126 0 0.000000
|
1819 |
+
42 131 0 0.000000
|
1820 |
+
42 174 0 0.000000
|
1821 |
+
42 175 0 0.000000
|
1822 |
+
42 291 0 0.000000
|
1823 |
+
42 294 0 0.000000
|
1824 |
+
42 345 0 0.000000
|
1825 |
+
42 346 0 0.000000
|
1826 |
+
42 359 0 0.000000
|
1827 |
+
42 360 0 0.000000
|
1828 |
+
42 363 0 0.000000
|
1829 |
+
42 400 0 0.000000
|
1830 |
+
42 421 0 0.000000
|
1831 |
+
42 432 0 0.000000
|
1832 |
+
42 454 0 0.000000
|
1833 |
+
42 457 0 0.000000
|
1834 |
+
42 459 0 0.000000
|
1835 |
+
42 460 0 0.000000
|
1836 |
+
42 461 0 0.000000
|
1837 |
+
42 463 0 0.000000
|
1838 |
+
42 469 0 0.000000
|
1839 |
+
42 505 0 0.000000
|
1840 |
+
42 535 0 0.000000
|
1841 |
+
42 540 0 0.000000
|
1842 |
+
42 553 0 0.000000
|
1843 |
+
42 554 0 0.000000
|
1844 |
+
42 599 0 0.000000
|
1845 |
+
42 640 0 0.000000
|
1846 |
+
42 724 0 0.000000
|
1847 |
+
42 803 0 0.000000
|
1848 |
+
42 901 0 0.000000
|
1849 |
+
42 917 0 0.000000
|
1850 |
+
42 1027 0 0.000000
|
1851 |
+
42 1035 0 0.000000
|
1852 |
+
42 1053 0 0.000000
|
1853 |
+
42 1169 0 0.000000
|
1854 |
+
42 1179 0 0.000000
|
1855 |
+
42 1181 0 0.000000
|
1856 |
+
42 1190 0 0.000000
|
1857 |
+
42 1191 0 0.000000
|
1858 |
+
42 1248 0 0.000000
|
1859 |
+
42 1309 0 0.000000
|
1860 |
+
42 1405 0 0.000000
|
1861 |
+
42 1412 0 0.000000
|
1862 |
+
43 114 0 0.000000
|
1863 |
+
43 120 0 0.000000
|
1864 |
+
43 128 0 0.000000
|
1865 |
+
43 135 0 0.000000
|
1866 |
+
43 144 0 0.000000
|
1867 |
+
43 157 0 0.000000
|
1868 |
+
43 175 0 0.000000
|
1869 |
+
43 350 0 0.000000
|
1870 |
+
43 511 0 0.000000
|
1871 |
+
43 567 0 0.000000
|
1872 |
+
43 694 0 0.000000
|
1873 |
+
43 835 0 0.000000
|
1874 |
+
43 867 0 0.000000
|
1875 |
+
44 2 0 0.000000
|
1876 |
+
44 10 0 0.000000
|
1877 |
+
44 32 0 0.000000
|
1878 |
+
44 33 0 0.000000
|
1879 |
+
44 34 0 0.000000
|
1880 |
+
44 37 0 0.000000
|
1881 |
+
44 40 0 0.000000
|
1882 |
+
44 41 0 0.000000
|
1883 |
+
44 49 0 0.000000
|
1884 |
+
44 63 0 0.000000
|
1885 |
+
44 87 0 0.000000
|
1886 |
+
44 90 0 0.000000
|
1887 |
+
44 98 0 0.000000
|
1888 |
+
44 113 0 0.000000
|
1889 |
+
44 115 0 0.000000
|
1890 |
+
44 116 0 0.000000
|
1891 |
+
44 165 0 0.000000
|
1892 |
+
44 166 0 0.000000
|
1893 |
+
44 178 0 0.000000
|
1894 |
+
44 192 0 0.000000
|
1895 |
+
44 198 0 0.000000
|
1896 |
+
44 199 0 0.000000
|
1897 |
+
44 202 0 0.000000
|
1898 |
+
44 203 0 0.000000
|
1899 |
+
44 204 0 0.000000
|
1900 |
+
44 205 0 0.000000
|
1901 |
+
44 211 0 0.000000
|
1902 |
+
44 215 0 0.000000
|
1903 |
+
44 219 0 0.000000
|
1904 |
+
44 225 0 0.000000
|
1905 |
+
44 234 0 0.000000
|
1906 |
+
44 242 0 0.000000
|
1907 |
+
44 252 0 0.000000
|
1908 |
+
44 253 0 0.000000
|
1909 |
+
44 341 0 0.000000
|
1910 |
+
44 347 0 0.000000
|
1911 |
+
44 355 0 0.000000
|
1912 |
+
44 371 0 0.000000
|
1913 |
+
44 375 0 0.000000
|
1914 |
+
44 376 0 0.000000
|
1915 |
+
44 381 0 0.000000
|
1916 |
+
44 384 0 0.000000
|
1917 |
+
44 395 0 0.000000
|
1918 |
+
44 415 0 0.000000
|
1919 |
+
44 453 0 0.000000
|
1920 |
+
44 465 0 0.000000
|
1921 |
+
44 467 0 0.000000
|
1922 |
+
44 482 0 0.000000
|
1923 |
+
44 491 0 0.000000
|
1924 |
+
44 495 0 0.000000
|
1925 |
+
44 515 0 0.000000
|
1926 |
+
44 517 0 0.000000
|
1927 |
+
44 520 0 0.000000
|
1928 |
+
44 529 0 0.000000
|
1929 |
+
44 535 0 0.000000
|
1930 |
+
44 560 0 0.000000
|
1931 |
+
44 580 0 0.000000
|
1932 |
+
44 582 0 0.000000
|
1933 |
+
44 588 0 0.000000
|
1934 |
+
44 605 0 0.000000
|
1935 |
+
44 607 0 0.000000
|
1936 |
+
44 609 0 0.000000
|
1937 |
+
44 613 0 0.000000
|
1938 |
+
44 614 0 0.000000
|
1939 |
+
44 616 0 0.000000
|
1940 |
+
44 619 0 0.000000
|
1941 |
+
44 622 0 0.000000
|
1942 |
+
44 666 0 0.000000
|
1943 |
+
44 667 0 0.000000
|
1944 |
+
44 711 0 0.000000
|
1945 |
+
44 712 0 0.000000
|
1946 |
+
44 714 0 0.000000
|
1947 |
+
44 716 0 0.000000
|
1948 |
+
44 717 0 0.000000
|
1949 |
+
44 719 0 0.000000
|
1950 |
+
44 721 0 0.000000
|
1951 |
+
44 725 0 0.000000
|
1952 |
+
44 728 0 0.000000
|
1953 |
+
44 731 0 0.000000
|
1954 |
+
44 756 0 0.000000
|
1955 |
+
44 763 0 0.000000
|
1956 |
+
44 767 0 0.000000
|
1957 |
+
44 770 0 0.000000
|
1958 |
+
44 771 0 0.000000
|
1959 |
+
44 773 0 0.000000
|
1960 |
+
44 775 0 0.000000
|
1961 |
+
44 777 0 0.000000
|
1962 |
+
44 782 0 0.000000
|
1963 |
+
44 800 0 0.000000
|
1964 |
+
44 821 0 0.000000
|
1965 |
+
44 831 0 0.000000
|
1966 |
+
44 839 0 0.000000
|
1967 |
+
44 888 0 0.000000
|
1968 |
+
44 889 0 0.000000
|
1969 |
+
44 905 0 0.000000
|
1970 |
+
44 914 0 0.000000
|
1971 |
+
44 916 0 0.000000
|
1972 |
+
44 933 0 0.000000
|
1973 |
+
44 943 0 0.000000
|
1974 |
+
44 944 0 0.000000
|
1975 |
+
44 952 0 0.000000
|
1976 |
+
44 958 0 0.000000
|
1977 |
+
44 977 0 0.000000
|
1978 |
+
44 983 0 0.000000
|
1979 |
+
44 996 0 0.000000
|
1980 |
+
44 1023 0 0.000000
|
1981 |
+
44 1060 0 0.000000
|
1982 |
+
44 1072 0 0.000000
|
1983 |
+
44 1076 0 0.000000
|
1984 |
+
44 1078 0 0.000000
|
1985 |
+
44 1080 0 0.000000
|
1986 |
+
44 1089 0 0.000000
|
1987 |
+
44 1090 0 0.000000
|
1988 |
+
44 1099 0 0.000000
|
1989 |
+
44 1109 0 0.000000
|
1990 |
+
44 1122 0 0.000000
|
1991 |
+
44 1167 0 0.000000
|
1992 |
+
44 1168 0 0.000000
|
1993 |
+
44 1181 0 0.000000
|
1994 |
+
44 1184 0 0.000000
|
1995 |
+
44 1203 0 0.000000
|
1996 |
+
44 1208 0 0.000000
|
1997 |
+
44 1223 0 0.000000
|
1998 |
+
44 1241 0 0.000000
|
1999 |
+
44 1253 0 0.000000
|
2000 |
+
44 1256 0 0.000000
|
2001 |
+
44 1257 0 0.000000
|
2002 |
+
44 1258 0 0.000000
|
2003 |
+
44 1268 0 0.000000
|
2004 |
+
44 1275 0 0.000000
|
2005 |
+
44 1277 0 0.000000
|
2006 |
+
44 1284 0 0.000000
|
2007 |
+
44 1286 0 0.000000
|
2008 |
+
44 1290 0 0.000000
|
2009 |
+
44 1295 0 0.000000
|
2010 |
+
44 1296 0 0.000000
|
2011 |
+
44 1298 0 0.000000
|
2012 |
+
44 1299 0 0.000000
|
2013 |
+
44 1319 0 0.000000
|
2014 |
+
44 1322 0 0.000000
|
2015 |
+
44 1324 0 0.000000
|
2016 |
+
44 1352 0 0.000000
|
2017 |
+
44 1355 0 0.000000
|
2018 |
+
44 1362 0 0.000000
|
2019 |
+
44 1369 0 0.000000
|
2020 |
+
44 1373 0 0.000000
|
2021 |
+
44 1417 0 0.000000
|
2022 |
+
44 1421 0 0.000000
|
2023 |
+
44 1428 0 0.000000
|
2024 |
+
44 1431 0 0.000000
|
2025 |
+
44 1432 0 0.000000
|
2026 |
+
44 1440 0 0.000000
|
2027 |
+
44 1446 0 0.000000
|
2028 |
+
44 1450 0 0.000000
|
2029 |
+
44 1460 0 0.000000
|
2030 |
+
45 4 0 0.000000
|
2031 |
+
45 5 0 0.000000
|
2032 |
+
45 11 0 0.000000
|
2033 |
+
45 12 0 0.000000
|
2034 |
+
45 17 0 0.000000
|
2035 |
+
45 24 0 0.000000
|
2036 |
+
45 36 0 0.000000
|
2037 |
+
45 46 0 0.000000
|
2038 |
+
45 56 0 0.000000
|
2039 |
+
45 64 0 0.000000
|
2040 |
+
45 74 0 0.000000
|
2041 |
+
45 90 0 0.000000
|
2042 |
+
45 115 0 0.000000
|
2043 |
+
45 136 0 0.000000
|
2044 |
+
45 141 0 0.000000
|
2045 |
+
45 142 0 0.000000
|
2046 |
+
45 177 0 0.000000
|
2047 |
+
45 178 0 0.000000
|
2048 |
+
45 272 0 0.000000
|
2049 |
+
45 323 0 0.000000
|
2050 |
+
45 548 0 0.000000
|
2051 |
+
45 555 0 0.000000
|
2052 |
+
45 607 0 0.000000
|
2053 |
+
45 660 0 0.000000
|
2054 |
+
45 664 0 0.000000
|
2055 |
+
45 721 0 0.000000
|
2056 |
+
45 723 0 0.000000
|
2057 |
+
45 724 0 0.000000
|
2058 |
+
45 725 0 0.000000
|
2059 |
+
45 728 0 0.000000
|
2060 |
+
45 731 0 0.000000
|
2061 |
+
45 739 0 0.000000
|
2062 |
+
45 823 0 0.000000
|
2063 |
+
45 839 0 0.000000
|
2064 |
+
45 848 0 0.000000
|
2065 |
+
45 879 0 0.000000
|
2066 |
+
45 881 0 0.000000
|
2067 |
+
45 887 0 0.000000
|
2068 |
+
45 888 0 0.000000
|
2069 |
+
45 906 0 0.000000
|
2070 |
+
45 907 0 0.000000
|
2071 |
+
45 908 0 0.000000
|
2072 |
+
45 911 0 0.000000
|
2073 |
+
45 913 0 0.000000
|
2074 |
+
45 916 0 0.000000
|
2075 |
+
45 923 0 0.000000
|
2076 |
+
45 924 0 0.000000
|
2077 |
+
45 925 0 0.000000
|
2078 |
+
45 934 0 0.000000
|
2079 |
+
45 940 0 0.000000
|
2080 |
+
45 941 0 0.000000
|
2081 |
+
45 943 0 0.000000
|
2082 |
+
45 960 0 0.000000
|
2083 |
+
45 963 0 0.000000
|
2084 |
+
45 991 0 0.000000
|
2085 |
+
45 998 0 0.000000
|
2086 |
+
45 1005 0 0.000000
|
2087 |
+
45 1009 0 0.000000
|
2088 |
+
45 1012 0 0.000000
|
2089 |
+
45 1043 0 0.000000
|
2090 |
+
45 1056 0 0.000000
|
2091 |
+
45 1149 0 0.000000
|
2092 |
+
45 1183 0 0.000000
|
2093 |
+
45 1215 0 0.000000
|
2094 |
+
45 1236 0 0.000000
|
2095 |
+
45 1240 0 0.000000
|
2096 |
+
45 1248 0 0.000000
|
2097 |
+
45 1251 0 0.000000
|
2098 |
+
45 1257 0 0.000000
|
2099 |
+
45 1258 0 0.000000
|
2100 |
+
45 1268 0 0.000000
|
2101 |
+
45 1367 0 0.000000
|
2102 |
+
45 1377 0 0.000000
|
2103 |
+
45 1383 0 0.000000
|
2104 |
+
45 1384 0 0.000000
|
2105 |
+
45 1391 0 0.000000
|
2106 |
+
45 1404 0 0.000000
|
2107 |
+
46 11 0 0.000000
|
2108 |
+
46 14 0 0.000000
|
2109 |
+
46 17 0 0.000000
|
2110 |
+
46 23 0 0.000000
|
2111 |
+
46 24 0 0.000000
|
2112 |
+
46 31 0 0.000000
|
2113 |
+
46 36 0 0.000000
|
2114 |
+
46 46 0 0.000000
|
2115 |
+
46 64 0 0.000000
|
2116 |
+
46 74 0 0.000000
|
2117 |
+
46 92 0 0.000000
|
2118 |
+
46 115 0 0.000000
|
2119 |
+
46 136 0 0.000000
|
2120 |
+
46 177 0 0.000000
|
2121 |
+
46 178 0 0.000000
|
2122 |
+
46 197 0 0.000000
|
2123 |
+
46 200 0 0.000000
|
2124 |
+
46 209 0 0.000000
|
2125 |
+
46 244 0 0.000000
|
2126 |
+
46 245 0 0.000000
|
2127 |
+
46 287 0 0.000000
|
2128 |
+
46 294 0 0.000000
|
2129 |
+
46 299 0 0.000000
|
2130 |
+
46 325 0 0.000000
|
2131 |
+
46 326 0 0.000000
|
2132 |
+
46 331 0 0.000000
|
2133 |
+
46 336 0 0.000000
|
2134 |
+
46 338 0 0.000000
|
2135 |
+
46 363 0 0.000000
|
2136 |
+
46 374 0 0.000000
|
2137 |
+
46 383 0 0.000000
|
2138 |
+
46 406 0 0.000000
|
2139 |
+
46 408 0 0.000000
|
2140 |
+
46 409 0 0.000000
|
2141 |
+
46 432 0 0.000000
|
2142 |
+
46 433 0 0.000000
|
2143 |
+
46 504 0 0.000000
|
2144 |
+
46 547 0 0.000000
|
2145 |
+
46 583 0 0.000000
|
2146 |
+
46 593 0 0.000000
|
2147 |
+
46 597 0 0.000000
|
2148 |
+
46 617 0 0.000000
|
2149 |
+
46 620 0 0.000000
|
2150 |
+
46 647 0 0.000000
|
2151 |
+
46 651 0 0.000000
|
2152 |
+
46 721 0 0.000000
|
2153 |
+
46 724 0 0.000000
|
2154 |
+
46 743 0 0.000000
|
2155 |
+
46 792 0 0.000000
|
2156 |
+
46 834 0 0.000000
|
2157 |
+
46 836 0 0.000000
|
2158 |
+
46 839 0 0.000000
|
2159 |
+
46 848 0 0.000000
|
2160 |
+
46 849 0 0.000000
|
2161 |
+
46 850 0 0.000000
|
2162 |
+
46 852 0 0.000000
|
2163 |
+
46 854 0 0.000000
|
2164 |
+
46 856 0 0.000000
|
2165 |
+
46 858 0 0.000000
|
2166 |
+
46 859 0 0.000000
|
2167 |
+
46 860 0 0.000000
|
2168 |
+
46 861 0 0.000000
|
2169 |
+
46 863 0 0.000000
|
2170 |
+
46 865 0 0.000000
|
2171 |
+
46 866 0 0.000000
|
2172 |
+
46 870 0 0.000000
|
2173 |
+
46 872 0 0.000000
|
2174 |
+
46 873 0 0.000000
|
2175 |
+
46 874 0 0.000000
|
2176 |
+
46 875 0 0.000000
|
2177 |
+
46 880 0 0.000000
|
2178 |
+
46 881 0 0.000000
|
2179 |
+
46 882 0 0.000000
|
2180 |
+
46 884 0 0.000000
|
2181 |
+
46 886 0 0.000000
|
2182 |
+
46 887 0 0.000000
|
2183 |
+
46 892 0 0.000000
|
2184 |
+
46 897 0 0.000000
|
2185 |
+
46 916 0 0.000000
|
2186 |
+
46 917 0 0.000000
|
2187 |
+
46 921 0 0.000000
|
2188 |
+
46 922 0 0.000000
|
2189 |
+
46 936 0 0.000000
|
2190 |
+
46 963 0 0.000000
|
2191 |
+
46 970 0 0.000000
|
2192 |
+
46 979 0 0.000000
|
2193 |
+
46 990 0 0.000000
|
2194 |
+
46 991 0 0.000000
|
2195 |
+
46 997 0 0.000000
|
2196 |
+
46 998 0 0.000000
|
2197 |
+
46 1012 0 0.000000
|
2198 |
+
46 1042 0 0.000000
|
2199 |
+
46 1043 0 0.000000
|
2200 |
+
46 1079 0 0.000000
|
2201 |
+
46 1193 0 0.000000
|
2202 |
+
46 1229 0 0.000000
|
2203 |
+
46 1230 0 0.000000
|
2204 |
+
46 1248 0 0.000000
|
2205 |
+
46 1251 0 0.000000
|
2206 |
+
46 1252 0 0.000000
|
2207 |
+
46 1264 0 0.000000
|
2208 |
+
46 1280 0 0.000000
|
2209 |
+
46 1351 0 0.000000
|
2210 |
+
46 1358 0 0.000000
|
2211 |
+
46 1366 0 0.000000
|
2212 |
+
46 1367 0 0.000000
|
2213 |
+
46 1368 0 0.000000
|
2214 |
+
46 1372 0 0.000000
|
2215 |
+
46 1376 0 0.000000
|
2216 |
+
46 1377 0 0.000000
|
2217 |
+
46 1397 0 0.000000
|
2218 |
+
46 1410 0 0.000000
|
2219 |
+
46 1415 0 0.000000
|
2220 |
+
46 1418 0 0.000000
|
2221 |
+
46 1434 0 0.000000
|
2222 |
+
46 1445 0 0.000000
|
2223 |
+
49 37 0 0.000000
|
2224 |
+
49 80 0 0.000000
|
2225 |
+
49 98 0 0.000000
|
2226 |
+
49 111 0 0.000000
|
2227 |
+
49 123 0 0.000000
|
2228 |
+
49 151 0 0.000000
|
2229 |
+
49 163 0 0.000000
|
2230 |
+
49 261 0 0.000000
|
2231 |
+
49 357 0 0.000000
|
2232 |
+
49 375 0 0.000000
|
2233 |
+
49 384 0 0.000000
|
2234 |
+
49 398 0 0.000000
|
2235 |
+
49 456 0 0.000000
|
2236 |
+
49 496 0 0.000000
|
2237 |
+
49 497 0 0.000000
|
2238 |
+
49 533 0 0.000000
|
2239 |
+
49 545 0 0.000000
|
2240 |
+
49 582 0 0.000000
|
2241 |
+
49 619 0 0.000000
|
2242 |
+
49 623 0 0.000000
|
2243 |
+
49 676 0 0.000000
|
2244 |
+
49 788 0 0.000000
|
2245 |
+
49 789 0 0.000000
|
2246 |
+
49 809 0 0.000000
|
2247 |
+
49 828 0 0.000000
|
2248 |
+
49 837 0 0.000000
|
2249 |
+
49 845 0 0.000000
|
2250 |
+
49 1044 0 0.000000
|
2251 |
+
49 1284 0 0.000000
|
2252 |
+
49 1297 0 0.000000
|
2253 |
+
49 1328 0 0.000000
|
2254 |
+
49 1348 0 0.000000
|
2255 |
+
49 1349 0 0.000000
|
2256 |
+
49 1364 0 0.000000
|
2257 |
+
50 1 0 0.000000
|
2258 |
+
50 16 0 0.000000
|
2259 |
+
50 45 0 0.000000
|
2260 |
+
50 80 0 0.000000
|
2261 |
+
50 154 0 0.000000
|
2262 |
+
50 209 0 0.000000
|
2263 |
+
50 257 0 0.000000
|
2264 |
+
50 258 0 0.000000
|
2265 |
+
50 259 0 0.000000
|
2266 |
+
50 260 0 0.000000
|
2267 |
+
50 262 0 0.000000
|
2268 |
+
50 263 0 0.000000
|
2269 |
+
50 275 0 0.000000
|
2270 |
+
50 276 0 0.000000
|
2271 |
+
50 333 0 0.000000
|
2272 |
+
50 334 0 0.000000
|
2273 |
+
50 335 0 0.000000
|
2274 |
+
50 342 0 0.000000
|
2275 |
+
50 354 0 0.000000
|
2276 |
+
50 361 0 0.000000
|
2277 |
+
50 388 0 0.000000
|
2278 |
+
50 404 0 0.000000
|
2279 |
+
50 480 0 0.000000
|
2280 |
+
50 488 0 0.000000
|
2281 |
+
50 522 0 0.000000
|
2282 |
+
50 527 0 0.000000
|
2283 |
+
50 530 0 0.000000
|
2284 |
+
50 564 0 0.000000
|
2285 |
+
50 576 0 0.000000
|
2286 |
+
50 596 0 0.000000
|
2287 |
+
50 608 0 0.000000
|
2288 |
+
50 701 0 0.000000
|
2289 |
+
50 702 0 0.000000
|
2290 |
+
50 758 0 0.000000
|
2291 |
+
50 769 0 0.000000
|
2292 |
+
50 797 0 0.000000
|
2293 |
+
50 801 0 0.000000
|
2294 |
+
50 817 0 0.000000
|
2295 |
+
50 820 0 0.000000
|
2296 |
+
50 825 0 0.000000
|
2297 |
+
50 830 0 0.000000
|
2298 |
+
50 838 0 0.000000
|
2299 |
+
50 853 0 0.000000
|
2300 |
+
50 868 0 0.000000
|
2301 |
+
50 869 0 0.000000
|
2302 |
+
50 884 0 0.000000
|
2303 |
+
50 898 0 0.000000
|
2304 |
+
50 931 0 0.000000
|
2305 |
+
50 960 0 0.000000
|
2306 |
+
50 966 0 0.000000
|
2307 |
+
50 989 0 0.000000
|
2308 |
+
50 993 0 0.000000
|
2309 |
+
50 996 0 0.000000
|
2310 |
+
50 999 0 0.000000
|
2311 |
+
50 1010 0 0.000000
|
2312 |
+
50 1066 0 0.000000
|
2313 |
+
50 1072 0 0.000000
|
2314 |
+
50 1074 0 0.000000
|
2315 |
+
50 1075 0 0.000000
|
2316 |
+
50 1103 0 0.000000
|
2317 |
+
50 1137 0 0.000000
|
2318 |
+
50 1140 0 0.000000
|
2319 |
+
50 1141 0 0.000000
|
2320 |
+
50 1170 0 0.000000
|
2321 |
+
50 1202 0 0.000000
|
2322 |
+
50 1215 0 0.000000
|
2323 |
+
50 1216 0 0.000000
|
2324 |
+
50 1230 0 0.000000
|
2325 |
+
50 1231 0 0.000000
|
2326 |
+
50 1259 0 0.000000
|
2327 |
+
50 1265 0 0.000000
|
2328 |
+
50 1266 0 0.000000
|
2329 |
+
50 1280 0 0.000000
|
2330 |
+
50 1283 0 0.000000
|
2331 |
+
50 1298 0 0.000000
|
2332 |
+
50 1351 0 0.000000
|
2333 |
+
50 1380 0 0.000000
|
2334 |
+
50 1391 0 0.000000
|
2335 |
+
50 1392 0 0.000000
|
2336 |
+
50 1393 0 0.000000
|
2337 |
+
50 1394 0 0.000000
|
2338 |
+
50 1395 0 0.000000
|
2339 |
+
50 1419 0 0.000000
|
2340 |
+
50 1421 0 0.000000
|
2341 |
+
50 1422 0 0.000000
|
2342 |
+
50 1426 0 0.000000
|
2343 |
+
50 1430 0 0.000000
|
2344 |
+
50 1442 0 0.000000
|
2345 |
+
50 1448 0 0.000000
|
2346 |
+
52 38 0 0.000000
|
2347 |
+
52 65 0 0.000000
|
2348 |
+
52 72 0 0.000000
|
2349 |
+
52 75 0 0.000000
|
2350 |
+
52 190 0 0.000000
|
2351 |
+
52 191 0 0.000000
|
2352 |
+
52 194 0 0.000000
|
2353 |
+
52 382 0 0.000000
|
2354 |
+
52 452 0 0.000000
|
2355 |
+
52 586 0 0.000000
|
2356 |
+
52 603 0 0.000000
|
2357 |
+
52 810 0 0.000000
|
2358 |
+
52 883 0 0.000000
|
2359 |
+
52 986 0 0.000000
|
2360 |
+
52 1051 0 0.000000
|
2361 |
+
54 6 0 0.000000
|
2362 |
+
54 11 0 0.000000
|
2363 |
+
54 14 0 0.000000
|
2364 |
+
54 22 0 0.000000
|
2365 |
+
54 24 0 0.000000
|
2366 |
+
54 90 0 0.000000
|
2367 |
+
54 114 0 0.000000
|
2368 |
+
54 177 0 0.000000
|
2369 |
+
54 187 0 0.000000
|
2370 |
+
54 272 0 0.000000
|
2371 |
+
54 284 0 0.000000
|
2372 |
+
54 285 0 0.000000
|
2373 |
+
54 293 0 0.000000
|
2374 |
+
54 323 0 0.000000
|
2375 |
+
54 339 0 0.000000
|
2376 |
+
54 371 0 0.000000
|
2377 |
+
54 387 0 0.000000
|
2378 |
+
54 414 0 0.000000
|
2379 |
+
54 555 0 0.000000
|
2380 |
+
54 592 0 0.000000
|
2381 |
+
54 598 0 0.000000
|
2382 |
+
54 607 0 0.000000
|
2383 |
+
54 832 0 0.000000
|
2384 |
+
54 839 0 0.000000
|
2385 |
+
54 849 0 0.000000
|
2386 |
+
54 857 0 0.000000
|
2387 |
+
54 879 0 0.000000
|
2388 |
+
54 881 0 0.000000
|
2389 |
+
54 896 0 0.000000
|
2390 |
+
54 906 0 0.000000
|
2391 |
+
54 907 0 0.000000
|
2392 |
+
54 908 0 0.000000
|
2393 |
+
54 911 0 0.000000
|
2394 |
+
54 923 0 0.000000
|
2395 |
+
54 924 0 0.000000
|
2396 |
+
54 925 0 0.000000
|
2397 |
+
54 934 0 0.000000
|
2398 |
+
54 954 0 0.000000
|
2399 |
+
54 1022 0 0.000000
|
2400 |
+
54 1149 0 0.000000
|
2401 |
+
54 1166 0 0.000000
|
2402 |
+
54 1198 0 0.000000
|
2403 |
+
54 1236 0 0.000000
|
2404 |
+
54 1240 0 0.000000
|
2405 |
+
54 1242 0 0.000000
|
2406 |
+
54 1248 0 0.000000
|
2407 |
+
54 1356 0 0.000000
|
2408 |
+
54 1367 0 0.000000
|
2409 |
+
54 1404 0 0.000000
|
2410 |
+
54 1423 0 0.000000
|
2411 |
+
54 1457 0 0.000000
|
2412 |
+
55 65 0 0.000000
|
2413 |
+
55 72 0 0.000000
|
2414 |
+
55 75 0 0.000000
|
2415 |
+
55 190 0 0.000000
|
2416 |
+
55 191 0 0.000000
|
2417 |
+
55 194 0 0.000000
|
2418 |
+
55 382 0 0.000000
|
2419 |
+
55 452 0 0.000000
|
2420 |
+
55 586 0 0.000000
|
2421 |
+
55 603 0 0.000000
|
2422 |
+
55 608 0 0.000000
|
2423 |
+
55 696 0 0.000000
|
2424 |
+
55 806 0 0.000000
|
2425 |
+
55 810 0 0.000000
|
2426 |
+
55 828 0 0.000000
|
2427 |
+
55 883 0 0.000000
|
2428 |
+
55 986 0 0.000000
|
2429 |
+
55 1051 0 0.000000
|
2430 |
+
56 1 0 0.000000
|
2431 |
+
56 9 0 0.000000
|
2432 |
+
56 16 0 0.000000
|
2433 |
+
56 17 0 0.000000
|
2434 |
+
56 24 0 0.000000
|
2435 |
+
56 36 0 0.000000
|
2436 |
+
56 86 0 0.000000
|
2437 |
+
56 90 0 0.000000
|
2438 |
+
56 154 0 0.000000
|
2439 |
+
56 159 0 0.000000
|
2440 |
+
56 388 0 0.000000
|
2441 |
+
56 480 0 0.000000
|
2442 |
+
56 488 0 0.000000
|
2443 |
+
56 530 0 0.000000
|
2444 |
+
56 797 0 0.000000
|
2445 |
+
56 825 0 0.000000
|
2446 |
+
56 830 0 0.000000
|
2447 |
+
56 838 0 0.000000
|
2448 |
+
56 884 0 0.000000
|
2449 |
+
56 1066 0 0.000000
|
2450 |
+
56 1074 0 0.000000
|
2451 |
+
56 1075 0 0.000000
|
2452 |
+
56 1137 0 0.000000
|
2453 |
+
56 1140 0 0.000000
|
2454 |
+
56 1141 0 0.000000
|
2455 |
+
56 1170 0 0.000000
|
2456 |
+
56 1202 0 0.000000
|
2457 |
+
56 1215 0 0.000000
|
2458 |
+
56 1230 0 0.000000
|
2459 |
+
56 1231 0 0.000000
|
2460 |
+
56 1259 0 0.000000
|
2461 |
+
56 1265 0 0.000000
|
2462 |
+
56 1266 0 0.000000
|
2463 |
+
56 1280 0 0.000000
|
2464 |
+
56 1298 0 0.000000
|
2465 |
+
56 1351 0 0.000000
|
2466 |
+
56 1391 0 0.000000
|
2467 |
+
56 1392 0 0.000000
|
2468 |
+
56 1393 0 0.000000
|
2469 |
+
56 1394 0 0.000000
|
2470 |
+
56 1395 0 0.000000
|
2471 |
+
56 1419 0 0.000000
|
2472 |
+
56 1430 0 0.000000
|
2473 |
+
56 1442 0 0.000000
|
2474 |
+
56 1448 0 0.000000
|
2475 |
+
57 16 0 0.000000
|
2476 |
+
57 36 0 0.000000
|
2477 |
+
57 86 0 0.000000
|
2478 |
+
57 178 0 0.000000
|
2479 |
+
57 388 0 0.000000
|
2480 |
+
57 404 0 0.000000
|
2481 |
+
57 480 0 0.000000
|
2482 |
+
57 488 0 0.000000
|
2483 |
+
57 530 0 0.000000
|
2484 |
+
57 825 0 0.000000
|
2485 |
+
57 830 0 0.000000
|
2486 |
+
57 838 0 0.000000
|
2487 |
+
57 884 0 0.000000
|
2488 |
+
57 931 0 0.000000
|
2489 |
+
57 998 0 0.000000
|
2490 |
+
57 1216 0 0.000000
|
2491 |
+
57 1230 0 0.000000
|
2492 |
+
57 1259 0 0.000000
|
2493 |
+
58 10 0 0.000000
|
2494 |
+
58 11 0 0.000000
|
2495 |
+
58 12 0 0.000000
|
2496 |
+
58 80 0 0.000000
|
2497 |
+
58 92 0 0.000000
|
2498 |
+
58 95 0 0.000000
|
2499 |
+
58 96 0 0.000000
|
2500 |
+
58 119 0 0.000000
|
2501 |
+
58 122 0 0.000000
|
2502 |
+
58 126 0 0.000000
|
2503 |
+
58 136 0 0.000000
|
2504 |
+
58 140 0 0.000000
|
2505 |
+
58 141 0 0.000000
|
2506 |
+
58 159 0 0.000000
|
2507 |
+
58 211 0 0.000000
|
2508 |
+
58 214 0 0.000000
|
2509 |
+
58 218 0 0.000000
|
2510 |
+
58 348 0 0.000000
|
2511 |
+
58 375 0 0.000000
|
2512 |
+
58 376 0 0.000000
|
2513 |
+
58 481 0 0.000000
|
2514 |
+
58 528 0 0.000000
|
2515 |
+
58 529 0 0.000000
|
2516 |
+
58 654 0 0.000000
|
2517 |
+
58 846 0 0.000000
|
2518 |
+
58 850 0 0.000000
|
2519 |
+
58 852 0 0.000000
|
2520 |
+
58 854 0 0.000000
|
2521 |
+
58 885 0 0.000000
|
2522 |
+
58 913 0 0.000000
|
2523 |
+
58 947 0 0.000000
|
2524 |
+
58 955 0 0.000000
|
2525 |
+
58 997 0 0.000000
|
2526 |
+
58 1011 0 0.000000
|
2527 |
+
58 1013 0 0.000000
|
2528 |
+
58 1079 0 0.000000
|
2529 |
+
58 1146 0 0.000000
|
2530 |
+
58 1149 0 0.000000
|
2531 |
+
58 1171 0 0.000000
|
2532 |
+
58 1198 0 0.000000
|
2533 |
+
58 1252 0 0.000000
|
2534 |
+
58 1258 0 0.000000
|
2535 |
+
58 1303 0 0.000000
|
2536 |
+
58 1362 0 0.000000
|
2537 |
+
58 1365 0 0.000000
|
2538 |
+
58 1367 0 0.000000
|
2539 |
+
61 29 0 0.000000
|
2540 |
+
61 42 0 0.000000
|
2541 |
+
61 58 0 0.000000
|
2542 |
+
61 70 0 0.000000
|
2543 |
+
61 78 0 0.000000
|
2544 |
+
61 117 0 0.000000
|
2545 |
+
61 525 0 0.000000
|
2546 |
+
61 642 0 0.000000
|
2547 |
+
61 648 0 0.000000
|
2548 |
+
61 755 0 0.000000
|
2549 |
+
61 1158 0 0.000000
|
2550 |
+
62 54 0 0.000000
|
2551 |
+
62 81 0 0.000000
|
2552 |
+
62 319 0 0.000000
|
2553 |
+
62 430 0 0.000000
|
2554 |
+
62 443 0 0.000000
|
2555 |
+
62 445 0 0.000000
|
2556 |
+
62 447 0 0.000000
|
2557 |
+
62 449 0 0.000000
|
2558 |
+
62 455 0 0.000000
|
2559 |
+
62 464 0 0.000000
|
2560 |
+
62 745 0 0.000000
|
2561 |
+
62 1103 0 0.000000
|
2562 |
+
65 45 0 0.000000
|
2563 |
+
65 328 0 0.000000
|
2564 |
+
65 422 0 0.000000
|
2565 |
+
65 448 0 0.000000
|
2566 |
+
65 479 0 0.000000
|
2567 |
+
65 483 0 0.000000
|
2568 |
+
65 485 0 0.000000
|
2569 |
+
65 503 0 0.000000
|
2570 |
+
65 509 0 0.000000
|
2571 |
+
65 566 0 0.000000
|
2572 |
+
65 632 0 0.000000
|
2573 |
+
65 635 0 0.000000
|
2574 |
+
65 660 0 0.000000
|
2575 |
+
66 10 0 0.000000
|
2576 |
+
66 24 0 0.000000
|
2577 |
+
66 80 0 0.000000
|
2578 |
+
66 92 0 0.000000
|
2579 |
+
66 119 0 0.000000
|
2580 |
+
66 122 0 0.000000
|
2581 |
+
66 126 0 0.000000
|
2582 |
+
66 140 0 0.000000
|
2583 |
+
66 145 0 0.000000
|
2584 |
+
66 169 0 0.000000
|
2585 |
+
66 172 0 0.000000
|
2586 |
+
66 211 0 0.000000
|
2587 |
+
66 214 0 0.000000
|
2588 |
+
66 218 0 0.000000
|
2589 |
+
66 348 0 0.000000
|
2590 |
+
66 375 0 0.000000
|
2591 |
+
66 376 0 0.000000
|
2592 |
+
66 481 0 0.000000
|
2593 |
+
66 528 0 0.000000
|
2594 |
+
66 645 0 0.000000
|
2595 |
+
66 654 0 0.000000
|
2596 |
+
66 854 0 0.000000
|
2597 |
+
66 885 0 0.000000
|
2598 |
+
66 947 0 0.000000
|
2599 |
+
66 997 0 0.000000
|
2600 |
+
66 1013 0 0.000000
|
2601 |
+
66 1079 0 0.000000
|
2602 |
+
66 1121 0 0.000000
|
2603 |
+
66 1146 0 0.000000
|
2604 |
+
66 1171 0 0.000000
|
2605 |
+
66 1198 0 0.000000
|
2606 |
+
66 1252 0 0.000000
|
2607 |
+
66 1303 0 0.000000
|
2608 |
+
66 1362 0 0.000000
|
2609 |
+
66 1367 0 0.000000
|
2610 |
+
67 35 0 0.000000
|
2611 |
+
67 38 0 0.000000
|
2612 |
+
67 45 0 0.000000
|
2613 |
+
67 53 0 0.000000
|
2614 |
+
67 65 0 0.000000
|
2615 |
+
67 86 0 0.000000
|
2616 |
+
67 116 0 0.000000
|
2617 |
+
67 129 0 0.000000
|
2618 |
+
67 150 0 0.000000
|
2619 |
+
67 429 0 0.000000
|
2620 |
+
67 465 0 0.000000
|
2621 |
+
67 483 0 0.000000
|
2622 |
+
67 510 0 0.000000
|
2623 |
+
67 524 0 0.000000
|
2624 |
+
67 541 0 0.000000
|
2625 |
+
67 576 0 0.000000
|
2626 |
+
67 589 0 0.000000
|
2627 |
+
67 603 0 0.000000
|
2628 |
+
67 661 0 0.000000
|
2629 |
+
67 662 0 0.000000
|
2630 |
+
67 663 0 0.000000
|
2631 |
+
67 671 0 0.000000
|
2632 |
+
67 677 0 0.000000
|
2633 |
+
67 680 0 0.000000
|
2634 |
+
67 700 0 0.000000
|
2635 |
+
67 701 0 0.000000
|
2636 |
+
67 704 0 0.000000
|
2637 |
+
67 715 0 0.000000
|
2638 |
+
67 868 0 0.000000
|
2639 |
+
67 869 0 0.000000
|
2640 |
+
67 1162 0 0.000000
|
2641 |
+
67 1164 0 0.000000
|
2642 |
+
69 30 0 0.000000
|
2643 |
+
69 69 0 0.000000
|
2644 |
+
69 71 0 0.000000
|
2645 |
+
69 77 0 0.000000
|
2646 |
+
69 151 0 0.000000
|
2647 |
+
69 166 0 0.000000
|
2648 |
+
69 212 0 0.000000
|
2649 |
+
69 434 0 0.000000
|
2650 |
+
69 501 0 0.000000
|
2651 |
+
69 504 0 0.000000
|
2652 |
+
69 653 0 0.000000
|
2653 |
+
69 688 0 0.000000
|
2654 |
+
69 701 0 0.000000
|
2655 |
+
69 703 0 0.000000
|
2656 |
+
69 1163 0 0.000000
|
2657 |
+
71 19 0 0.000000
|
2658 |
+
71 30 0 0.000000
|
2659 |
+
71 34 0 0.000000
|
2660 |
+
71 38 0 0.000000
|
2661 |
+
71 51 0 0.000000
|
2662 |
+
71 52 0 0.000000
|
2663 |
+
71 53 0 0.000000
|
2664 |
+
71 69 0 0.000000
|
2665 |
+
71 71 0 0.000000
|
2666 |
+
71 150 0 0.000000
|
2667 |
+
71 174 0 0.000000
|
2668 |
+
71 175 0 0.000000
|
2669 |
+
71 329 0 0.000000
|
2670 |
+
71 421 0 0.000000
|
2671 |
+
71 446 0 0.000000
|
2672 |
+
71 480 0 0.000000
|
2673 |
+
71 499 0 0.000000
|
2674 |
+
71 517 0 0.000000
|
2675 |
+
71 566 0 0.000000
|
2676 |
+
71 571 0 0.000000
|
2677 |
+
71 666 0 0.000000
|
2678 |
+
71 680 0 0.000000
|
2679 |
+
71 715 0 0.000000
|
2680 |
+
71 769 0 0.000000
|
2681 |
+
71 1124 0 0.000000
|
2682 |
+
71 1131 0 0.000000
|
2683 |
+
71 1388 0 0.000000
|
2684 |
+
76 10 0 0.000000
|
2685 |
+
76 11 0 0.000000
|
2686 |
+
76 12 0 0.000000
|
2687 |
+
76 80 0 0.000000
|
2688 |
+
76 92 0 0.000000
|
2689 |
+
76 95 0 0.000000
|
2690 |
+
76 96 0 0.000000
|
2691 |
+
76 119 0 0.000000
|
2692 |
+
76 126 0 0.000000
|
2693 |
+
76 136 0 0.000000
|
2694 |
+
76 141 0 0.000000
|
2695 |
+
76 210 0 0.000000
|
2696 |
+
76 211 0 0.000000
|
2697 |
+
76 216 0 0.000000
|
2698 |
+
76 218 0 0.000000
|
2699 |
+
76 340 0 0.000000
|
2700 |
+
76 348 0 0.000000
|
2701 |
+
76 371 0 0.000000
|
2702 |
+
76 375 0 0.000000
|
2703 |
+
76 394 0 0.000000
|
2704 |
+
76 431 0 0.000000
|
2705 |
+
76 481 0 0.000000
|
2706 |
+
76 550 0 0.000000
|
2707 |
+
76 551 0 0.000000
|
2708 |
+
76 552 0 0.000000
|
2709 |
+
76 647 0 0.000000
|
2710 |
+
76 654 0 0.000000
|
2711 |
+
76 766 0 0.000000
|
2712 |
+
76 846 0 0.000000
|
2713 |
+
76 850 0 0.000000
|
2714 |
+
76 854 0 0.000000
|
2715 |
+
76 885 0 0.000000
|
2716 |
+
76 913 0 0.000000
|
2717 |
+
76 921 0 0.000000
|
2718 |
+
76 926 0 0.000000
|
2719 |
+
76 937 0 0.000000
|
2720 |
+
76 939 0 0.000000
|
2721 |
+
76 943 0 0.000000
|
2722 |
+
76 947 0 0.000000
|
2723 |
+
76 955 0 0.000000
|
2724 |
+
76 972 0 0.000000
|
2725 |
+
76 981 0 0.000000
|
2726 |
+
76 984 0 0.000000
|
2727 |
+
76 997 0 0.000000
|
2728 |
+
76 1011 0 0.000000
|
2729 |
+
76 1013 0 0.000000
|
2730 |
+
76 1146 0 0.000000
|
2731 |
+
76 1149 0 0.000000
|
2732 |
+
76 1171 0 0.000000
|
2733 |
+
76 1198 0 0.000000
|
2734 |
+
76 1236 0 0.000000
|
2735 |
+
76 1251 0 0.000000
|
2736 |
+
76 1252 0 0.000000
|
2737 |
+
76 1258 0 0.000000
|
2738 |
+
76 1303 0 0.000000
|
2739 |
+
76 1354 0 0.000000
|
2740 |
+
76 1362 0 0.000000
|
2741 |
+
76 1367 0 0.000000
|
2742 |
+
76 1390 0 0.000000
|
2743 |
+
76 1397 0 0.000000
|
2744 |
+
79 62 0 0.000000
|
2745 |
+
79 150 0 0.000000
|
2746 |
+
79 315 0 0.000000
|
2747 |
+
79 450 0 0.000000
|
2748 |
+
79 484 0 0.000000
|
2749 |
+
79 562 0 0.000000
|
2750 |
+
79 680 0 0.000000
|
2751 |
+
79 687 0 0.000000
|
2752 |
+
79 700 0 0.000000
|
2753 |
+
79 708 0 0.000000
|
2754 |
+
79 862 0 0.000000
|
2755 |
+
81 38 0 0.000000
|
2756 |
+
81 68 0 0.000000
|
2757 |
+
81 71 0 0.000000
|
2758 |
+
81 135 0 0.000000
|
2759 |
+
81 179 0 0.000000
|
2760 |
+
81 321 0 0.000000
|
2761 |
+
81 329 0 0.000000
|
2762 |
+
81 1118 0 0.000000
|
2763 |
+
81 1124 0 0.000000
|
2764 |
+
81 1323 0 0.000000
|
2765 |
+
81 1381 0 0.000000
|
2766 |
+
82 478 0 0.000000
|
2767 |
+
82 519 0 0.000000
|
2768 |
+
82 542 0 0.000000
|
2769 |
+
82 628 0 0.000000
|
2770 |
+
82 641 0 0.000000
|
2771 |
+
82 1073 0 0.000000
|
2772 |
+
82 1116 0 0.000000
|
2773 |
+
82 1125 0 0.000000
|
2774 |
+
82 1130 0 0.000000
|
2775 |
+
82 1175 0 0.000000
|
2776 |
+
84 28 0 0.000000
|
2777 |
+
84 49 0 0.000000
|
2778 |
+
84 72 0 0.000000
|
2779 |
+
84 319 0 0.000000
|
2780 |
+
84 445 0 0.000000
|
2781 |
+
84 447 0 0.000000
|
2782 |
+
84 449 0 0.000000
|
2783 |
+
84 483 0 0.000000
|
2784 |
+
84 484 0 0.000000
|
2785 |
+
84 652 0 0.000000
|
2786 |
+
84 1134 0 0.000000
|
2787 |
+
90 3 0 0.000000
|
2788 |
+
90 39 0 0.000000
|
2789 |
+
90 41 0 0.000000
|
2790 |
+
90 42 0 0.000000
|
2791 |
+
90 47 0 0.000000
|
2792 |
+
90 48 0 0.000000
|
2793 |
+
90 76 0 0.000000
|
2794 |
+
90 89 0 0.000000
|
2795 |
+
90 95 0 0.000000
|
2796 |
+
90 96 0 0.000000
|
2797 |
+
90 97 0 0.000000
|
2798 |
+
90 98 0 0.000000
|
2799 |
+
90 99 0 0.000000
|
2800 |
+
90 101 0 0.000000
|
2801 |
+
90 104 0 0.000000
|
2802 |
+
90 105 0 0.000000
|
2803 |
+
90 107 0 0.000000
|
2804 |
+
90 109 0 0.000000
|
2805 |
+
90 111 0 0.000000
|
2806 |
+
90 155 0 0.000000
|
2807 |
+
90 314 0 0.000000
|
2808 |
+
90 343 0 0.000000
|
2809 |
+
90 356 0 0.000000
|
2810 |
+
90 362 0 0.000000
|
2811 |
+
90 439 0 0.000000
|
2812 |
+
90 440 0 0.000000
|
2813 |
+
90 503 0 0.000000
|
2814 |
+
90 513 0 0.000000
|
2815 |
+
90 543 0 0.000000
|
2816 |
+
90 544 0 0.000000
|
2817 |
+
90 560 0 0.000000
|
2818 |
+
90 602 0 0.000000
|
2819 |
+
90 613 0 0.000000
|
2820 |
+
90 618 0 0.000000
|
2821 |
+
90 632 0 0.000000
|
2822 |
+
90 749 0 0.000000
|
2823 |
+
90 753 0 0.000000
|
2824 |
+
90 805 0 0.000000
|
2825 |
+
90 819 0 0.000000
|
2826 |
+
90 893 0 0.000000
|
2827 |
+
90 1030 0 0.000000
|
2828 |
+
90 1061 0 0.000000
|
2829 |
+
90 1062 0 0.000000
|
2830 |
+
90 1082 0 0.000000
|
2831 |
+
90 1083 0 0.000000
|
2832 |
+
90 1087 0 0.000000
|
2833 |
+
90 1128 0 0.000000
|
2834 |
+
90 1135 0 0.000000
|
2835 |
+
90 1168 0 0.000000
|
2836 |
+
90 1235 0 0.000000
|
2837 |
+
90 1273 0 0.000000
|
2838 |
+
90 1274 0 0.000000
|
2839 |
+
90 1278 0 0.000000
|
2840 |
+
90 1279 0 0.000000
|
2841 |
+
90 1285 0 0.000000
|
2842 |
+
90 1287 0 0.000000
|
2843 |
+
90 1289 0 0.000000
|
2844 |
+
90 1300 0 0.000000
|
2845 |
+
90 1301 0 0.000000
|
2846 |
+
90 1302 0 0.000000
|
2847 |
+
90 1304 0 0.000000
|
2848 |
+
90 1312 0 0.000000
|
2849 |
+
90 1313 0 0.000000
|
2850 |
+
90 1335 0 0.000000
|
2851 |
+
90 1338 0 0.000000
|
2852 |
+
90 1341 0 0.000000
|
2853 |
+
90 1344 0 0.000000
|
2854 |
+
90 1346 0 0.000000
|
2855 |
+
90 1380 0 0.000000
|
2856 |
+
90 1444 0 0.000000
|
2857 |
+
92 37 0 0.000000
|
2858 |
+
92 40 0 0.000000
|
2859 |
+
92 83 0 0.000000
|
2860 |
+
92 125 0 0.000000
|
2861 |
+
92 127 0 0.000000
|
2862 |
+
92 129 0 0.000000
|
2863 |
+
92 145 0 0.000000
|
2864 |
+
92 241 0 0.000000
|
2865 |
+
92 252 0 0.000000
|
2866 |
+
92 310 0 0.000000
|
2867 |
+
92 330 0 0.000000
|
2868 |
+
92 357 0 0.000000
|
2869 |
+
92 375 0 0.000000
|
2870 |
+
92 442 0 0.000000
|
2871 |
+
92 491 0 0.000000
|
2872 |
+
92 507 0 0.000000
|
2873 |
+
92 520 0 0.000000
|
2874 |
+
92 529 0 0.000000
|
2875 |
+
92 604 0 0.000000
|
2876 |
+
92 623 0 0.000000
|
2877 |
+
92 631 0 0.000000
|
2878 |
+
92 741 0 0.000000
|
2879 |
+
92 813 0 0.000000
|
2880 |
+
92 822 0 0.000000
|
2881 |
+
92 878 0 0.000000
|
2882 |
+
92 882 0 0.000000
|
2883 |
+
92 921 0 0.000000
|
2884 |
+
92 1076 0 0.000000
|
2885 |
+
92 1078 0 0.000000
|
2886 |
+
92 1104 0 0.000000
|
2887 |
+
92 1105 0 0.000000
|
2888 |
+
92 1112 0 0.000000
|
2889 |
+
92 1368 0 0.000000
|
2890 |
+
92 1370 0 0.000000
|
2891 |
+
92 1375 0 0.000000
|
2892 |
+
92 1376 0 0.000000
|
2893 |
+
92 1377 0 0.000000
|
2894 |
+
92 1396 0 0.000000
|
2895 |
+
95 54 0 0.000000
|
2896 |
+
95 319 0 0.000000
|
2897 |
+
95 430 0 0.000000
|
2898 |
+
95 443 0 0.000000
|
2899 |
+
95 445 0 0.000000
|
2900 |
+
95 447 0 0.000000
|
2901 |
+
95 449 0 0.000000
|
2902 |
+
95 455 0 0.000000
|
2903 |
+
95 464 0 0.000000
|
2904 |
+
95 745 0 0.000000
|
2905 |
+
95 810 0 0.000000
|
2906 |
+
96 319 0 0.000000
|
2907 |
+
96 430 0 0.000000
|
2908 |
+
96 443 0 0.000000
|
2909 |
+
96 445 0 0.000000
|
2910 |
+
96 447 0 0.000000
|
2911 |
+
96 449 0 0.000000
|
2912 |
+
96 455 0 0.000000
|
2913 |
+
96 464 0 0.000000
|
2914 |
+
96 745 0 0.000000
|
2915 |
+
97 54 0 0.000000
|
2916 |
+
97 531 0 0.000000
|
2917 |
+
97 790 0 0.000000
|
2918 |
+
97 810 0 0.000000
|
2919 |
+
97 824 0 0.000000
|
2920 |
+
97 895 0 0.000000
|
2921 |
+
98 90 0 0.000000
|
2922 |
+
98 124 0 0.000000
|
2923 |
+
98 378 0 0.000000
|
2924 |
+
98 416 0 0.000000
|
2925 |
+
98 451 0 0.000000
|
2926 |
+
98 475 0 0.000000
|
2927 |
+
98 484 0 0.000000
|
2928 |
+
98 495 0 0.000000
|
2929 |
+
98 508 0 0.000000
|
2930 |
+
98 512 0 0.000000
|
2931 |
+
98 528 0 0.000000
|
2932 |
+
98 546 0 0.000000
|
2933 |
+
98 567 0 0.000000
|
2934 |
+
98 579 0 0.000000
|
2935 |
+
98 593 0 0.000000
|
2936 |
+
98 594 0 0.000000
|
2937 |
+
98 606 0 0.000000
|
2938 |
+
98 611 0 0.000000
|
2939 |
+
98 626 0 0.000000
|
2940 |
+
98 637 0 0.000000
|
2941 |
+
98 642 0 0.000000
|
2942 |
+
98 779 0 0.000000
|
2943 |
+
98 796 0 0.000000
|
2944 |
+
98 809 0 0.000000
|
2945 |
+
98 1035 0 0.000000
|
2946 |
+
98 1079 0 0.000000
|
2947 |
+
98 1366 0 0.000000
|
2948 |
+
98 1368 0 0.000000
|
2949 |
+
98 1375 0 0.000000
|
2950 |
+
99 27 0 0.000000
|
2951 |
+
99 65 0 0.000000
|
2952 |
+
99 74 0 0.000000
|
2953 |
+
99 90 0 0.000000
|
2954 |
+
99 124 0 0.000000
|
2955 |
+
99 134 0 0.000000
|
2956 |
+
99 137 0 0.000000
|
2957 |
+
99 139 0 0.000000
|
2958 |
+
99 147 0 0.000000
|
2959 |
+
99 378 0 0.000000
|
2960 |
+
99 416 0 0.000000
|
2961 |
+
99 451 0 0.000000
|
2962 |
+
99 484 0 0.000000
|
2963 |
+
99 508 0 0.000000
|
2964 |
+
99 512 0 0.000000
|
2965 |
+
99 528 0 0.000000
|
2966 |
+
99 546 0 0.000000
|
2967 |
+
99 567 0 0.000000
|
2968 |
+
99 579 0 0.000000
|
2969 |
+
99 593 0 0.000000
|
2970 |
+
99 594 0 0.000000
|
2971 |
+
99 606 0 0.000000
|
2972 |
+
99 611 0 0.000000
|
2973 |
+
99 626 0 0.000000
|
2974 |
+
99 637 0 0.000000
|
2975 |
+
99 648 0 0.000000
|
2976 |
+
99 658 0 0.000000
|
2977 |
+
99 779 0 0.000000
|
2978 |
+
99 796 0 0.000000
|
2979 |
+
99 1035 0 0.000000
|
2980 |
+
99 1079 0 0.000000
|
2981 |
+
99 1366 0 0.000000
|
2982 |
+
99 1368 0 0.000000
|
2983 |
+
99 1375 0 0.000000
|
2984 |
+
100 13 0 0.000000
|
2985 |
+
100 24 0 0.000000
|
2986 |
+
100 138 0 0.000000
|
2987 |
+
100 180 0 0.000000
|
2988 |
+
100 232 0 0.000000
|
2989 |
+
100 376 0 0.000000
|
2990 |
+
100 672 0 0.000000
|
2991 |
+
100 682 0 0.000000
|
2992 |
+
100 861 0 0.000000
|
2993 |
+
100 863 0 0.000000
|
2994 |
+
100 880 0 0.000000
|
2995 |
+
100 892 0 0.000000
|
2996 |
+
100 1014 0 0.000000
|
2997 |
+
100 1057 0 0.000000
|
2998 |
+
100 1058 0 0.000000
|
2999 |
+
100 1059 0 0.000000
|
3000 |
+
100 1229 0 0.000000
|
3001 |
+
100 1371 0 0.000000
|
3002 |
+
101 1204 0 0.000000
|
3003 |
+
102 19 0 0.000000
|
3004 |
+
102 44 0 0.000000
|
3005 |
+
102 51 0 0.000000
|
3006 |
+
102 69 0 0.000000
|
3007 |
+
102 77 0 0.000000
|
3008 |
+
102 79 0 0.000000
|
3009 |
+
102 146 0 0.000000
|
3010 |
+
102 149 0 0.000000
|
3011 |
+
102 175 0 0.000000
|
3012 |
+
102 176 0 0.000000
|
3013 |
+
102 446 0 0.000000
|
3014 |
+
102 489 0 0.000000
|
3015 |
+
102 531 0 0.000000
|
3016 |
+
102 562 0 0.000000
|
3017 |
+
102 643 0 0.000000
|
3018 |
+
102 644 0 0.000000
|
3019 |
+
102 649 0 0.000000
|
3020 |
+
102 659 0 0.000000
|
3021 |
+
102 660 0 0.000000
|
3022 |
+
102 708 0 0.000000
|
3023 |
+
102 790 0 0.000000
|
3024 |
+
102 812 0 0.000000
|
3025 |
+
102 824 0 0.000000
|
3026 |
+
102 894 0 0.000000
|
3027 |
+
104 19 0 0.000000
|
3028 |
+
104 26 0 0.000000
|
3029 |
+
104 28 0 0.000000
|
3030 |
+
104 53 0 0.000000
|
3031 |
+
104 176 0 0.000000
|
3032 |
+
104 562 0 0.000000
|
3033 |
+
104 644 0 0.000000
|
3034 |
+
104 659 0 0.000000
|
3035 |
+
104 1103 0 0.000000
|
3036 |
+
104 1126 0 0.000000
|
3037 |
+
104 1134 0 0.000000
|
3038 |
+
109 3 0 0.000000
|
3039 |
+
109 39 0 0.000000
|
3040 |
+
109 41 0 0.000000
|
3041 |
+
109 42 0 0.000000
|
3042 |
+
109 47 0 0.000000
|
3043 |
+
109 48 0 0.000000
|
3044 |
+
109 66 0 0.000000
|
3045 |
+
109 76 0 0.000000
|
3046 |
+
109 88 0 0.000000
|
3047 |
+
109 89 0 0.000000
|
3048 |
+
109 95 0 0.000000
|
3049 |
+
109 96 0 0.000000
|
3050 |
+
109 97 0 0.000000
|
3051 |
+
109 102 0 0.000000
|
3052 |
+
109 103 0 0.000000
|
3053 |
+
109 104 0 0.000000
|
3054 |
+
109 105 0 0.000000
|
3055 |
+
109 107 0 0.000000
|
3056 |
+
109 108 0 0.000000
|
3057 |
+
109 109 0 0.000000
|
3058 |
+
109 111 0 0.000000
|
3059 |
+
109 112 0 0.000000
|
3060 |
+
109 113 0 0.000000
|
3061 |
+
109 155 0 0.000000
|
3062 |
+
109 314 0 0.000000
|
3063 |
+
109 343 0 0.000000
|
3064 |
+
109 356 0 0.000000
|
3065 |
+
109 362 0 0.000000
|
3066 |
+
109 439 0 0.000000
|
3067 |
+
109 440 0 0.000000
|
3068 |
+
109 503 0 0.000000
|
3069 |
+
109 513 0 0.000000
|
3070 |
+
109 543 0 0.000000
|
3071 |
+
109 544 0 0.000000
|
3072 |
+
109 560 0 0.000000
|
3073 |
+
109 602 0 0.000000
|
3074 |
+
109 613 0 0.000000
|
3075 |
+
109 618 0 0.000000
|
3076 |
+
109 632 0 0.000000
|
3077 |
+
109 749 0 0.000000
|
3078 |
+
109 753 0 0.000000
|
3079 |
+
109 819 0 0.000000
|
3080 |
+
109 893 0 0.000000
|
3081 |
+
109 1030 0 0.000000
|
3082 |
+
109 1061 0 0.000000
|
3083 |
+
109 1062 0 0.000000
|
3084 |
+
109 1087 0 0.000000
|
3085 |
+
109 1128 0 0.000000
|
3086 |
+
109 1135 0 0.000000
|
3087 |
+
109 1168 0 0.000000
|
3088 |
+
109 1235 0 0.000000
|
3089 |
+
109 1273 0 0.000000
|
3090 |
+
109 1274 0 0.000000
|
3091 |
+
109 1278 0 0.000000
|
3092 |
+
109 1279 0 0.000000
|
3093 |
+
109 1285 0 0.000000
|
3094 |
+
109 1287 0 0.000000
|
3095 |
+
109 1289 0 0.000000
|
3096 |
+
109 1300 0 0.000000
|
3097 |
+
109 1301 0 0.000000
|
3098 |
+
109 1302 0 0.000000
|
3099 |
+
109 1304 0 0.000000
|
3100 |
+
109 1312 0 0.000000
|
3101 |
+
109 1313 0 0.000000
|
3102 |
+
109 1335 0 0.000000
|
3103 |
+
109 1338 0 0.000000
|
3104 |
+
109 1341 0 0.000000
|
3105 |
+
109 1344 0 0.000000
|
3106 |
+
109 1346 0 0.000000
|
3107 |
+
109 1380 0 0.000000
|
3108 |
+
109 1444 0 0.000000
|
3109 |
+
111 328 0 0.000000
|
3110 |
+
111 422 0 0.000000
|
3111 |
+
111 448 0 0.000000
|
3112 |
+
111 485 0 0.000000
|
3113 |
+
111 503 0 0.000000
|
3114 |
+
111 509 0 0.000000
|
content/cisi.tar.gz
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:bddb284e19369d153dad90770ae897e19221b0bc50e1329b5a702aa56f5e8483
|
3 |
+
size 775144
|
models/BM25Okapi.pkl
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:6e98bc061ce069fc32c9694dc24e0747f5941fea78cd5d4e8871c281bb906be1
|
3 |
+
size 1803997
|
models/BM25Plus.pkl
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:6e98bc061ce069fc32c9694dc24e0747f5941fea78cd5d4e8871c281bb906be1
|
3 |
+
size 1803997
|
models/BM25_simple.pkl
ADDED
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
1 |
+
version https://git-lfs.github.com/spec/v1
|
2 |
+
oid sha256:bc58b564c8a305bdf680eb685325df451c4828b4b2b1fb70d6cdd90c495a4a4b
|
3 |
+
size 3022555
|
requirements.txt
ADDED
@@ -0,0 +1,6 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
numpy==1.22.1
|
2 |
+
pandas==1.4.3
|
3 |
+
nltk==3.8.1
|
4 |
+
rank-bm25==0.2.2
|
5 |
+
streamlit==1.18.1
|
6 |
+
emoji==2.2.0
|