pdf_name stringclasses 19
values | page_number int64 0 23 | markdown stringlengths 0 7.25k | html stringlengths 0 7.32k | layout stringlengths 105 9.33k | lines stringlengths 2 27.9k | images stringlengths 2 598 | equations stringlengths 2 7.55k | tables stringclasses 1
value | page_size stringclasses 4
values | content_list stringlengths 45 8.34k | base_layout_detection stringlengths 540 32.2k | pdf_info stringlengths 1.6k 68.2k | image imagewidth (px) 2.01k 2.55k | image_path stringlengths 53 54 | image_rel_path stringlengths 22 23 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0705.1209.pdf | 11 | militarised conflict. The unit of analysis is a dyad-year. After the omission, a total of 27737 with
26845 peace and 892 conflict dyad-years were filtered out.
The dyadic data was classified into two sets, which are training and testing set. In their study
(Lagazio and Russett, 2003), have given a detailed discussion ... | <p>militarised conflict. The unit of analysis is a dyad-year. After the omission, a total of 27737 with
26845 peace and 892 conflict dyad-years were filtered out.</p>
<p>The dyadic data was classified into two sets, which are training and testing set. In their study
(Lagazio and Russett, 2003), have given a detailed di... | [{"type": "text", "coordinates": [65, 70, 549, 114], "content": "militarised conflict. The unit of analysis is a dyad-year. After the omission, a total of 27737 with\n26845 peace and 892 conflict dyad-years were filtered out.", "block_type": "text", "index": 1}, {"type": "text", "coordinates": [64, 153, 549, 308], "con... | [{"type": "text", "coordinates": [64, 72, 547, 88], "content": "militarised conflict. The unit of analysis is a dyad-year. After the omission, a total of 27737 with", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [64, 99, 349, 115], "content": "26845 peace and 892 conflict dyad-years were filtered out.", "... | [] | [{"type": "inline", "coordinates": [471, 569, 495, 581], "content": "79\\%", "caption": ""}, {"type": "inline", "coordinates": [519, 569, 543, 581], "content": "75\\%", "caption": ""}, {"type": "inline", "coordinates": [329, 596, 353, 609], "content": "74\\%", "caption": ""}, {"type": "inline", "coordinates": [380, 596... | [] | [612.0, 792.0] | [{"type": "text", "text": "", "page_idx": 11}, {"type": "text", "text": "The dyadic data was classified into two sets, which are training and testing set. In their study (Lagazio and Russett, 2003), have given a detailed discussion on how the training set should be chosen. They have found out that a balanced set, equal... | [{"category_id": 0, "poly": [630.7972412109375, 964.9227905273438, 1118.1270751953125, 964.9227905273438, 1118.1270751953125, 1008.2015991210938, 630.7972412109375, 1008.2015991210938], "score": 0.999997615814209}, {"category_id": 1, "poly": [180.7300567626953, 195.82745361328125, 1525.4786376953125, 195.82745361328125... | {"preproc_blocks": [{"type": "text", "bbox": [65, 70, 549, 114], "lines": [{"bbox": [64, 72, 547, 88], "spans": [{"bbox": [64, 72, 547, 88], "score": 1.0, "content": "militarised conflict. The unit of analysis is a dyad-year. After the omission, a total of 27737 with", "type": "text"}], "index": 0}, {"bbox": [64, 99, 3... | ./arxiv_full_mineru_outputs_20/images/0705.1209_11.png | images/0705.1209_11.png | |
0705.1209.pdf | 12 | $$\mathbf{T}\mathbf{C}=$$ true conflict (true positive), $$\mathrm{FC=}$$ false conflict (false positive), $$\mathrm{TP=}$$ true peace (true negative), and $$\mathrm{FP=}$$ false
peace (false negative)
# A. Receiver operating characteristic (ROC) curve
The receiver operating characteristic is a technique used to eval... | <p>$$\mathbf{T}\mathbf{C}=$$ true conflict (true positive), $$\mathrm{FC=}$$ false conflict (false positive), $$\mathrm{TP=}$$ true peace (true negative), and $$\mathrm{FP=}$$ false
peace (false negative)</p>
<h1>A. Receiver operating characteristic (ROC) curve</h1>
<p>The receiver operating characteristic is a techniq... | [{"type": "table", "coordinates": [174, 168, 451, 233], "content": "", "block_type": "table", "index": 1}, {"type": "text", "coordinates": [64, 249, 548, 280], "content": "$$\\mathbf{T}\\mathbf{C}=$$ true conflict (true positive), $$\\mathrm{FC=}$$ false conflict (false positive), $$\\mathrm{TP=}$$ true peace (true neg... | [{"type": "inline_equation", "coordinates": [82, 250, 107, 261], "content": "\\mathbf{T}\\mathbf{C}=", "score": 0.31, "index": 1}, {"type": "text", "coordinates": [107, 250, 221, 266], "content": "true conflict (true positive), ", "score": 1.0, "index": 2}, {"type": "inline_equation", "coordinates": [221, 250, 240, 261... | [] | [{"type": "block", "coordinates": [211, 616, 355, 652], "content": "", "caption": ""}, {"type": "inline", "coordinates": [82, 250, 107, 261], "content": "\\mathbf{T}\\mathbf{C}=", "caption": ""}, {"type": "inline", "coordinates": [221, 250, 240, 261], "content": "\\mathrm{FC=}", "caption": ""}, {"type": "inline", "coor... | [] | [612.0, 792.0] | [{"type": "table", "img_path": "images/4e5e97aa94995695fb71dbc0f5704c44678762e65d44e8d30ca408ab085998cc.jpg", "table_caption": ["TABLE I NN AND SVM CLASSIFICATION RESULTS "], "table_footnote": [], "page_idx": 12}, {"type": "text", "text": "$\\mathbf{T}\\mathbf{C}=$ true conflict (true positive), $\\mathrm{FC=}$ false c... | [{"category_id": 5, "poly": [485.7293395996094, 467.813720703125, 1253.807861328125, 467.813720703125, 1253.807861328125, 649.4524536132812, 485.7293395996094, 649.4524536132812], "score": 0.999997615814209}, {"category_id": 8, "poly": [592.2650146484375, 1716.4498291015625, 989.2007446289062, 1716.4498291015625, 989.2... | {"preproc_blocks": [{"type": "table", "bbox": [174, 168, 451, 233], "blocks": [{"type": "table_caption", "bbox": [216, 123, 412, 153], "group_id": 0, "lines": [{"bbox": [294, 124, 336, 135], "spans": [{"bbox": [294, 124, 336, 135], "score": 1.0, "content": "TABLE I ", "type": "text"}], "index": 0}, {"bbox": [218, 142, ... | ./arxiv_full_mineru_outputs_20/images/0705.1209_12.png | images/0705.1209_12.png | |
0705.1209.pdf | 13 | is 2.697, which gives significant difference in a $$95\%$$ confidence interval. The results of the SVM
are much better in predicting the conflicts without affecting the prediction of peace as it is clearly
shown in I. The ROC graphs of the NN and SVM results are given in figure 3.
# B. Influence of each variable on th... | <p>is 2.697, which gives significant difference in a $$95\%$$ confidence interval. The results of the SVM
are much better in predicting the conflicts without affecting the prediction of peace as it is clearly
shown in I. The ROC graphs of the NN and SVM results are given in figure 3.</p>
<h1>B. Influence of each variab... | [{"type": "text", "coordinates": [65, 70, 549, 142], "content": "is 2.697, which gives significant difference in a $$95\\%$$ confidence interval. The results of the SVM\nare much better in predicting the conflicts without affecting the prediction of peace as it is clearly\nshown in I. The ROC graphs of the NN and SVM r... | [{"type": "text", "coordinates": [64, 73, 302, 88], "content": "is 2.697, which gives significant difference in a ", "score": 1.0, "index": 1}, {"type": "inline_equation", "coordinates": [302, 72, 326, 84], "content": "95\\%", "score": 0.86, "index": 2}, {"type": "text", "coordinates": [326, 73, 547, 88], "content": " ... | [{"coordinates": [177, 162, 443, 381], "index": 13.5, "caption": "and se-nn are their respective standard errors.", "caption_coordinates": [64, 396, 548, 428]}] | [{"type": "inline", "coordinates": [302, 72, 326, 84], "content": "95\\%", "caption": ""}] | [] | [612.0, 792.0] | [{"type": "text", "text": "is 2.697, which gives significant difference in a $95\\%$ confidence interval. The results of the SVM are much better in predicting the conflicts without affecting the prediction of peace as it is clearly shown in I. The ROC graphs of the NN and SVM results are given in figure 3. ", "page_idx... | [{"category_id": 1, "poly": [181.217529296875, 195.40289306640625, 1526.70556640625, 195.40289306640625, 1526.70556640625, 394.6222229003906, 181.217529296875, 394.6222229003906], "score": 0.9999982714653015}, {"category_id": 1, "poly": [181.5133819580078, 1352.6549072265625, 1525.02880859375, 1352.6549072265625, 1525.... | {"preproc_blocks": [{"type": "text", "bbox": [65, 70, 549, 142], "lines": [{"bbox": [64, 72, 547, 88], "spans": [{"bbox": [64, 73, 302, 88], "score": 1.0, "content": "is 2.697, which gives significant difference in a ", "type": "text"}, {"bbox": [302, 72, 326, 84], "score": 0.86, "content": "95\\%", "type": "inline_equ... | ./arxiv_full_mineru_outputs_20/images/0705.1209_13.png | images/0705.1209_13.png | |
0705.1209.pdf | 14 | other hand, keeping all the variables to their maximum values while assigning one variable to its
minimum value resulted in a peaceful outcome. In other words, no single variable is able to change
the outcome if all the other variables are set to their possible maximum values for NN. A similar
experiment conducted for ... | <p>other hand, keeping all the variables to their maximum values while assigning one variable to its
minimum value resulted in a peaceful outcome. In other words, no single variable is able to change
the outcome if all the other variables are set to their possible maximum values for NN. A similar
experiment conducted f... | [{"type": "text", "coordinates": [65, 70, 549, 225], "content": "other hand, keeping all the variables to their maximum values while assigning one variable to its\nminimum value resulted in a peaceful outcome. In other words, no single variable is able to change\nthe outcome if all the other variables are set to their ... | [{"type": "text", "coordinates": [66, 74, 546, 88], "content": "other hand, keeping all the variables to their maximum values while assigning one variable to its", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [64, 100, 547, 117], "content": "minimum value resulted in a peaceful outcome. In other words, no... | [] | [{"type": "inline", "coordinates": [256, 596, 280, 609], "content": "98\\%", "caption": ""}, {"type": "inline", "coordinates": [190, 624, 214, 636], "content": "20\\%", "caption": ""}, {"type": "inline", "coordinates": [384, 624, 402, 636], "content": "6\\%", "caption": ""}, {"type": "inline", "coordinates": [446, 652,... | [] | [612.0, 792.0] | [{"type": "text", "text": "", "page_idx": 14}, {"type": "text", "text": "2) Experiment two: This experiment was done to measure the sensitivity of the variables in the spirit of partial derivatives as (Zeng, 1999) has put it. The idea is basically to see the change in the output for a change in one of the input variabl... | [{"category_id": 1, "poly": [180.9905548095703, 195.77496337890625, 1526.608154296875, 195.77496337890625, 1526.608154296875, 626.348388671875, 180.9905548095703, 626.348388671875], "score": 0.9999967813491821}, {"category_id": 1, "poly": [180.14822387695312, 1423.76513671875, 1528.08837890625, 1423.76513671875, 1528.0... | {"preproc_blocks": [{"type": "text", "bbox": [65, 70, 549, 225], "lines": [{"bbox": [66, 74, 546, 88], "spans": [{"bbox": [66, 74, 546, 88], "score": 1.0, "content": "other hand, keeping all the variables to their maximum values while assigning one variable to its", "type": "text"}], "index": 0}, {"bbox": [64, 100, 547... | ./arxiv_full_mineru_outputs_20/images/0705.1209_14.png | images/0705.1209_14.png | |
0705.1209.pdf | 15 | number of conflicts by $$45\%$$ and $$31\%$$ , respectively. This last result agrees with the realist theory
that says far apart countries have less reasons to have conflicts (Oneal and Russett, 1999).
SVM result: The results of the experiment show inconsistency on how the MID outcome is
affected when the variables ar... | <p>number of conflicts by $$45\%$$ and $$31\%$$ , respectively. This last result agrees with the realist theory
that says far apart countries have less reasons to have conflicts (Oneal and Russett, 1999).</p>
<p>SVM result: The results of the experiment show inconsistency on how the MID outcome is
affected when the var... | [{"type": "text", "coordinates": [63, 70, 548, 116], "content": "number of conflicts by $$45\\%$$ and $$31\\%$$ , respectively. This last result agrees with the realist theory\nthat says far apart countries have less reasons to have conflicts (Oneal and Russett, 1999).", "block_type": "text", "index": 1}, {"type": "tab... | [{"type": "text", "coordinates": [64, 73, 181, 88], "content": "number of conflicts by ", "score": 1.0, "index": 1}, {"type": "inline_equation", "coordinates": [181, 72, 205, 84], "content": "45\\%", "score": 0.86, "index": 2}, {"type": "text", "coordinates": [205, 73, 228, 88], "content": " and ", "score": 1.0, "index... | [] | [{"type": "inline", "coordinates": [181, 72, 205, 84], "content": "45\\%", "caption": ""}, {"type": "inline", "coordinates": [229, 72, 252, 84], "content": "31\\%", "caption": ""}] | [] | [612.0, 792.0] | [{"type": "text", "text": "", "page_idx": 15}, {"type": "table", "img_path": "images/ece4abff895ffaf599dd768236437efc65a34d294121656d1d65ac967af3cc7f.jpg", "table_caption": ["TABLE II THE EFFECT OF CHANGING ONE VARIABLE WHILE KEEPING THE OTHER VARIABLES FIXED "], "table_footnote": [], "page_idx": 15}, {"type": "text", ... | [{"category_id": 1, "poly": [180.21560668945312, 1532.834716796875, 1526.272216796875, 1532.834716796875, 1526.272216796875, 1967.9090576171875, 180.21560668945312, 1967.9090576171875], "score": 0.9999946355819702}, {"category_id": 1, "poly": [177.5340576171875, 195.25982666015625, 1523.6005859375, 195.25982666015625, ... | {"preproc_blocks": [{"type": "text", "bbox": [63, 70, 548, 116], "lines": [{"bbox": [64, 72, 547, 88], "spans": [{"bbox": [64, 73, 181, 88], "score": 1.0, "content": "number of conflicts by ", "type": "text"}, {"bbox": [181, 72, 205, 84], "score": 0.86, "content": "45\\%", "type": "inline_equation", "height": 12, "widt... | ./arxiv_full_mineru_outputs_20/images/0705.1209_15.png | images/0705.1209_15.png | |
0705.1209.pdf | 16 | suggested in (Guyon and Elisseeff, 2003). The rankings of the effects of variables on the MID for
NN and SVM vary as shown in table III. The reason for the variance may be because in the case of
NN the chain effect of changes in one variable to the other variables is accounted for (as the
variables are believed to be h... | <p>suggested in (Guyon and Elisseeff, 2003). The rankings of the effects of variables on the MID for
NN and SVM vary as shown in table III. The reason for the variance may be because in the case of
NN the chain effect of changes in one variable to the other variables is accounted for (as the
variables are believed to b... | [{"type": "text", "coordinates": [64, 70, 549, 197], "content": "suggested in (Guyon and Elisseeff, 2003). The rankings of the effects of variables on the MID for\nNN and SVM vary as shown in table III. The reason for the variance may be because in the case of\nNN the chain effect of changes in one variable to the othe... | [{"type": "text", "coordinates": [65, 73, 547, 88], "content": "suggested in (Guyon and Elisseeff, 2003). The rankings of the effects of variables on the MID for", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [64, 100, 548, 117], "content": "NN and SVM vary as shown in table III. The reason for the varian... | [] | [] | [] | [612.0, 792.0] | [{"type": "text", "text": "", "page_idx": 16}, {"type": "text", "text": "TABLE III ", "text_level": 1, "page_idx": 16}, {"type": "table", "img_path": "images/db87a5b870a8f2bd0a24c9535677c11ac7d915a156f3faffc9459fb4fa95d1eb.jpg", "table_caption": ["RANKINGS OF THE INFLUENCE OF VARIABLES FOR NN AND SVM "], "table_footnot... | [{"category_id": 0, "poly": [746.1339721679688, 1434.37646484375, 1005.5526733398438, 1434.37646484375, 1005.5526733398438, 1476.2164306640625, 746.1339721679688, 1476.2164306640625], "score": 0.9999980926513672}, {"category_id": 1, "poly": [180.30166625976562, 195.46543884277344, 1527.481689453125, 195.46543884277344,... | {"preproc_blocks": [{"type": "text", "bbox": [64, 70, 549, 197], "lines": [{"bbox": [65, 73, 547, 88], "spans": [{"bbox": [65, 73, 547, 88], "score": 1.0, "content": "suggested in (Guyon and Elisseeff, 2003). The rankings of the effects of variables on the MID for", "type": "text"}], "index": 0}, {"bbox": [64, 100, 548... | ./arxiv_full_mineru_outputs_20/images/0705.1209_16.png | images/0705.1209_16.png | |
0705.1209.pdf | 17 | The results found show that SVM has better capacity in forecasting conflicts without effectively
affecting the correct peace prediction than NN. Two separate experiments were conducted to see
the influence of each variable to the MID outcome. The first one assigns each variable to its
possible highest value while keepi... | <p>The results found show that SVM has better capacity in forecasting conflicts without effectively
affecting the correct peace prediction than NN. Two separate experiments were conducted to see
the influence of each variable to the MID outcome. The first one assigns each variable to its
possible highest value while ke... | [{"type": "text", "coordinates": [65, 70, 548, 281], "content": "The results found show that SVM has better capacity in forecasting conflicts without effectively\naffecting the correct peace prediction than NN. Two separate experiments were conducted to see\nthe influence of each variable to the MID outcome. The first ... | [{"type": "text", "coordinates": [82, 73, 546, 89], "content": "The results found show that SVM has better capacity in forecasting conflicts without effectively", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [66, 101, 547, 116], "content": "affecting the correct peace prediction than NN. Two separate expe... | [] | [] | [] | [612.0, 792.0] | [{"type": "text", "text": "The results found show that SVM has better capacity in forecasting conflicts without effectively affecting the correct peace prediction than NN. Two separate experiments were conducted to see the influence of each variable to the MID outcome. The first one assigns each variable to its possibl... | [{"category_id": 1, "poly": [181.62887573242188, 195.9350128173828, 1524.871337890625, 195.9350128173828, 1524.871337890625, 782.1871948242188, 181.62887573242188, 782.1871948242188], "score": 0.9999951124191284}, {"category_id": 1, "poly": [180.84393310546875, 810.8982543945312, 1524.4786376953125, 810.8982543945312, ... | {"preproc_blocks": [{"type": "text", "bbox": [65, 70, 548, 281], "lines": [{"bbox": [82, 73, 546, 89], "spans": [{"bbox": [82, 73, 546, 89], "score": 1.0, "content": "The results found show that SVM has better capacity in forecasting conflicts without effectively", "type": "text"}], "index": 0}, {"bbox": [66, 101, 547,... | ./arxiv_full_mineru_outputs_20/images/0705.1209_17.png | images/0705.1209_17.png | |
0705.1209.pdf | 18 | COW, (2004), Correlates of War Poject, http://www.umich.edu/ cowproj/index.html, Last date
accessed: Sept, 2004.
Gochman, C and Z. Maoz. (1984), Militarized Interstate Disputes 1816-1976, Journal of Conflict
Resolution, vol. 28, no. 4, pp. 585–615
Guyon, I. and A. Elisseeff, (2003), An introduction to variable and feat... | <p>COW, (2004), Correlates of War Poject, http://www.umich.edu/ cowproj/index.html, Last date
accessed: Sept, 2004.
Gochman, C and Z. Maoz. (1984), Militarized Interstate Disputes 1816-1976, Journal of Conflict
Resolution, vol. 28, no. 4, pp. 585–615
Guyon, I. and A. Elisseeff, (2003), An introduction to variable and f... | [{"type": "text", "coordinates": [62, 77, 550, 683], "content": "COW, (2004), Correlates of War Poject, http://www.umich.edu/ cowproj/index.html, Last date\naccessed: Sept, 2004.\nGochman, C and Z. Maoz. (1984), Militarized Interstate Disputes 1816-1976, Journal of Conflict\nResolution, vol. 28, no. 4, pp. 585\u2013615... | [{"type": "text", "coordinates": [64, 86, 547, 103], "content": "COW, (2004), Correlates of War Poject, http://www.umich.edu/ cowproj/index.html, Last date", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [65, 101, 169, 116], "content": "accessed: Sept, 2004.", "score": 1.0, "index": 2}, {"type": "text", "c... | [] | [] | [] | [612.0, 792.0] | [{"type": "text", "text": "", "page_idx": 18}, {"type": "text", "text": "Automation and Remote Control, vol. 24, pp. 774\u2013780, 1963. ", "page_idx": 18}] | [{"category_id": 1, "poly": [178.90460205078125, 1848.5123291015625, 1524.226318359375, 1848.5123291015625, 1524.226318359375, 1935.773681640625, 178.90460205078125, 1935.773681640625], "score": 0.999065101146698}, {"category_id": 1, "poly": [178.91619873046875, 1773.7279052734375, 1453.2467041015625, 1773.727905273437... | {"preproc_blocks": [{"type": "text", "bbox": [62, 77, 550, 683], "lines": [{"bbox": [64, 86, 547, 103], "spans": [{"bbox": [64, 86, 547, 103], "score": 1.0, "content": "COW, (2004), Correlates of War Poject, http://www.umich.edu/ cowproj/index.html, Last date", "type": "text"}], "index": 0}, {"bbox": [65, 101, 169, 116... | ./arxiv_full_mineru_outputs_20/images/0705.1209_18.png | images/0705.1209_18.png | |
0705.1209.pdf | 19 | Vapnik, V (1995), The Nature of Statistical Learning Theory. New York: Springer Verlag
Westin, L (2001), Receiver operating characteristic (ROC) analysis: Evaluating discriminance
effects among decision support systems, Tech. Rep. UMINF 01.18, ISSN-0348-0542, Department
of Computer Science, Umea University, SE-90187, ... | <p>Vapnik, V (1995), The Nature of Statistical Learning Theory. New York: Springer Verlag</p>
<p>Westin, L (2001), Receiver operating characteristic (ROC) analysis: Evaluating discriminance
effects among decision support systems, Tech. Rep. UMINF 01.18, ISSN-0348-0542, Department
of Computer Science, Umea University, S... | [{"type": "text", "coordinates": [65, 71, 500, 85], "content": "Vapnik, V (1995), The Nature of Statistical Learning Theory. New York: Springer Verlag", "block_type": "text", "index": 1}, {"type": "text", "coordinates": [65, 99, 547, 154], "content": "Westin, L (2001), Receiver operating characteristic (ROC) analysis: ... | [{"type": "text", "coordinates": [65, 72, 500, 89], "content": "Vapnik, V (1995), The Nature of Statistical Learning Theory. New York: Springer Verlag ", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [64, 100, 548, 116], "content": "Westin, L (2001), Receiver operating characteristic (ROC) analysis: Evalua... | [] | [] | [] | [612.0, 792.0] | [{"type": "text", "text": "Vapnik, V (1995), The Nature of Statistical Learning Theory. New York: Springer Verlag ", "page_idx": 19}, {"type": "text", "text": "Westin, L (2001), Receiver operating characteristic (ROC) analysis: Evaluating discriminance effects among decision support systems, Tech. Rep. UMINF 01.18, ISS... | [{"category_id": 1, "poly": [182.19534301757812, 1389.1671142578125, 1518.2647705078125, 1389.1671142578125, 1518.2647705078125, 1581.2122802734375, 182.19534301757812, 1581.2122802734375], "score": 0.9999651908874512}, {"category_id": 1, "poly": [182.34222412109375, 1118.517578125, 1520.8681640625, 1118.517578125, 152... | {"preproc_blocks": [{"type": "text", "bbox": [65, 71, 500, 85], "lines": [{"bbox": [65, 72, 500, 89], "spans": [{"bbox": [65, 72, 500, 89], "score": 1.0, "content": "Vapnik, V (1995), The Nature of Statistical Learning Theory. New York: Springer Verlag ", "type": "text"}], "index": 0}], "index": 0}, {"type": "text", "b... | ./arxiv_full_mineru_outputs_20/images/0705.1209_19.png | images/0705.1209_19.png | |
0704.1394.pdf | 0 | # Calculating Valid Domains for BDD-Based Interactive
Configuration
Tarik Hadzic, Rune Moller Jensen, Henrik Reif Andersen
Computational Logic and Algorithms Group,
IT University of Copenhagen, Denmark
tarik@itu.dk,rmj@itu.dk,hra@itu.dk
Abstract. In these notes we formally describe the functionality of Calculating
V... | <h1>Calculating Valid Domains for BDD-Based Interactive
Configuration</h1>
<p>Tarik Hadzic, Rune Moller Jensen, Henrik Reif Andersen</p>
<p>Computational Logic and Algorithms Group,
IT University of Copenhagen, Denmark
tarik@itu.dk,rmj@itu.dk,hra@itu.dk</p>
<p>Abstract. In these notes we formally describe the functiona... | [{"type": "title", "coordinates": [140, 111, 475, 147], "content": "Calculating Valid Domains for BDD-Based Interactive\nConfiguration", "block_type": "title", "index": 1}, {"type": "text", "coordinates": [193, 168, 423, 180], "content": "Tarik Hadzic, Rune Moller Jensen, Henrik Reif Andersen", "block_type": "text", "i... | [{"type": "text", "coordinates": [142, 115, 473, 129], "content": "Calculating Valid Domains for BDD-Based Interactive", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [264, 132, 351, 148], "content": "Configuration", "score": 1.0, "index": 2}, {"type": "text", "coordinates": [192, 171, 422, 181], "content"... | [] | [] | [] | [612.0, 792.0] | [{"type": "text", "text": "Calculating Valid Domains for BDD-Based Interactive Configuration ", "text_level": 1, "page_idx": 0}, {"type": "text", "text": "Tarik Hadzic, Rune Moller Jensen, Henrik Reif Andersen ", "page_idx": 0}, {"type": "text", "text": "Computational Logic and Algorithms Group, IT University of Copenh... | [{"category_id": 0, "poly": [389.1514587402344, 309.7539978027344, 1319.447021484375, 309.7539978027344, 1319.447021484375, 410.518310546875, 389.1514587402344, 410.518310546875], "score": 0.9999982714653015}, {"category_id": 0, "poly": [372.89398193359375, 849.965087890625, 607.7208862304688, 849.965087890625, 607.720... | {"preproc_blocks": [{"type": "title", "bbox": [140, 111, 475, 147], "lines": [{"bbox": [142, 115, 473, 129], "spans": [{"bbox": [142, 115, 473, 129], "score": 1.0, "content": "Calculating Valid Domains for BDD-Based Interactive", "type": "text"}], "index": 0}, {"bbox": [264, 132, 351, 148], "spans": [{"bbox": [264, 132... | ./arxiv_full_mineru_outputs_20/images/0704.1394_0.png | images/0704.1394_0.png | |
0704.1394.pdf | 1 | Definition 1. $$A$$ configuration model $$C$$ is a triple $$(X,D,F)$$ where $$X$$ is a set of vari-
ables $$\{x_{0},\ldots,x_{n-1}\}$$ , $$D=D_{0}\times...\times D_{n-1}$$ is the Cartesian product of their finite
domains $$D_{0},\ldots,D_{n-1}$$ and $$F=\{f_{0},...,f_{m-1}\}$$ is a set of propositional formulae over
at... | <p>Definition 1. $$A$$ configuration model $$C$$ is a triple $$(X,D,F)$$ where $$X$$ is a set of vari-
ables $$\{x_{0},\ldots,x_{n-1}\}$$ , $$D=D_{0}\times...\times D_{n-1}$$ is the Cartesian product of their finite
domains $$D_{0},\ldots,D_{n-1}$$ and $$F=\{f_{0},...,f_{m-1}\}$$ is a set of propositional formulae over... | [{"type": "text", "coordinates": [133, 115, 482, 175], "content": "Definition 1. $$A$$ configuration model $$C$$ is a triple $$(X,D,F)$$ where $$X$$ is a set of vari-\nables $$\\{x_{0},\\ldots,x_{n-1}\\}$$ , $$D=D_{0}\\times...\\times D_{n-1}$$ is the Cartesian product of their finite\ndomains $$D_{0},\\ldots,D_{n-1}$$... | [{"type": "text", "coordinates": [133, 117, 189, 129], "content": "Definition 1.", "score": 1.0, "index": 1}, {"type": "inline_equation", "coordinates": [190, 117, 198, 126], "content": "A", "score": 0.28, "index": 2}, {"type": "text", "coordinates": [198, 117, 283, 129], "content": " configuration model", "score": 1.0... | [{"coordinates": [], "index": 27, "caption": "Fig. 1. Solution space for the T-shirt example", "caption_coordinates": [216, 526, 399, 538]}] | [{"type": "block", "coordinates": [150, 470, 464, 517], "content": "", "caption": ""}, {"type": "inline", "coordinates": [190, 117, 198, 126], "content": "A", "caption": ""}, {"type": "inline", "coordinates": [284, 117, 293, 127], "content": "C", "caption": ""}, {"type": "inline", "coordinates": [337, 117, 379, 128], "... | [] | [612.0, 792.0] | [{"type": "text", "text": "Definition 1. $A$ configuration model $C$ is a triple $(X,D,F)$ where $X$ is a set of variables $\\{x_{0},\\ldots,x_{n-1}\\}$ , $D=D_{0}\\times...\\times D_{n-1}$ is the Cartesian product of their finite domains $D_{0},\\ldots,D_{n-1}$ and $F=\\{f_{0},...,f_{m-1}\\}$ is a set of propositional... | [{"category_id": 0, "poly": [373.2566833496094, 1631.62060546875, 635.5687255859375, 1631.62060546875, 635.5687255859375, 1662.5599365234375, 373.2566833496094, 1662.5599365234375], "score": 0.9999968409538269}, {"category_id": 1, "poly": [371.1575927734375, 512.0772094726562, 1337.76025390625, 512.0772094726562, 1337.... | {"preproc_blocks": [{"type": "text", "bbox": [133, 115, 482, 175], "lines": [{"bbox": [133, 117, 480, 129], "spans": [{"bbox": [133, 117, 189, 129], "score": 1.0, "content": "Definition 1.", "type": "text"}, {"bbox": [190, 117, 198, 126], "score": 0.28, "content": "A", "type": "inline_equation", "height": 9, "width": 8... | ./arxiv_full_mineru_outputs_20/images/0704.1394_1.png | images/0704.1394_1.png | |
0704.1394.pdf | 2 | The significance of this demand is that it guarantees the user backtrack-free assignment
to variables as long as he selects values from valid domains. This reduces cognitive
effort during the interaction and increases usability.
At each step of the interaction, the configurator reports the valid domains to the
user, b... | <p>The significance of this demand is that it guarantees the user backtrack-free assignment
to variables as long as he selects values from valid domains. This reduces cognitive
effort during the interaction and increases usability.</p>
<p>At each step of the interaction, the configurator reports the valid domains to th... | [{"type": "text", "coordinates": [133, 116, 482, 152], "content": "The significance of this demand is that it guarantees the user backtrack-free assignment\nto variables as long as he selects values from valid domains. This reduces cognitive\neffort during the interaction and increases usability.", "block_type": "text"... | [{"type": "text", "coordinates": [134, 118, 481, 128], "content": "The significance of this demand is that it guarantees the user backtrack-free assignment", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [132, 129, 481, 141], "content": "to variables as long as he selects values from valid domains. This re... | [] | [{"type": "inline", "coordinates": [316, 167, 324, 176], "content": "\\rho", "caption": ""}, {"type": "inline", "coordinates": [296, 176, 376, 189], "content": "x_{j}\\;\\in\\;X\\;\\backslash\\;d o m(\\rho)", "caption": ""}, {"type": "inline", "coordinates": [248, 188, 285, 202], "content": "v_{j}\\,\\in{\\cal D}_{j}^{... | [] | [612.0, 792.0] | [{"type": "text", "text": "The significance of this demand is that it guarantees the user backtrack-free assignment to variables as long as he selects values from valid domains. This reduces cognitive effort during the interaction and increases usability. ", "page_idx": 2}, {"type": "text", "text": "At each step of the... | [{"category_id": 1, "poly": [370.28045654296875, 1375.8978271484375, 1340.8123779296875, 1375.8978271484375, 1340.8123779296875, 1644.2275390625, 370.28045654296875, 1644.2275390625], "score": 0.9999915957450867}, {"category_id": 1, "poly": [371.99505615234375, 711.5205688476562, 1340.14453125, 711.5205688476562, 1340.... | {"preproc_blocks": [{"type": "text", "bbox": [133, 116, 482, 152], "lines": [{"bbox": [134, 118, 481, 128], "spans": [{"bbox": [134, 118, 481, 128], "score": 1.0, "content": "The significance of this demand is that it guarantees the user backtrack-free assignment", "type": "text"}], "index": 0}, {"bbox": [132, 129, 481... | ./arxiv_full_mineru_outputs_20/images/0704.1394_2.png | images/0704.1394_2.png | |
0704.1394.pdf | 3 | is associated with a Boolean variable and has two outgoing edges low and high. Given
an assignment of the variables, the value of the Boolean function is determined by a
path starting at the root node and recursively following the high edge, if the associated
variable is true, and the low edge, if the associated variab... | <p>is associated with a Boolean variable and has two outgoing edges low and high. Given
an assignment of the variables, the value of the Boolean function is determined by a
path starting at the root node and recursively following the high edge, if the associated
variable is true, and the low edge, if the associated var... | [{"type": "text", "coordinates": [133, 116, 482, 188], "content": "is associated with a Boolean variable and has two outgoing edges low and high. Given\nan assignment of the variables, the value of the Boolean function is determined by a\npath starting at the root node and recursively following the high edge, if the as... | [{"type": "text", "coordinates": [133, 117, 480, 129], "content": "is associated with a Boolean variable and has two outgoing edges low and high. Given", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [133, 130, 481, 142], "content": "an assignment of the variables, the value of the Boolean function is dete... | [{"coordinates": [236, 245, 376, 314], "index": 11, "caption": "(b)", "caption_coordinates": [353, 336, 367, 348]}] | [{"type": "inline", "coordinates": [358, 190, 365, 198], "content": "u", "caption": ""}, {"type": "inline", "coordinates": [383, 190, 389, 198], "content": "v", "caption": ""}, {"type": "inline", "coordinates": [434, 203, 442, 210], "content": "u", "caption": ""}, {"type": "inline", "coordinates": [275, 645, 284, 653],... | [] | [612.0, 792.0] | [{"type": "text", "text": "", "page_idx": 3}, {"type": "text", "text": "A BDD is reduced such that no pair of distinct nodes $u$ and $v$ are associated with the same variable and low and high successors (Fig. 3a), and no variable node $u$ has identical low and high successors (Fig. 3b). Due to these reductions, the num... | [{"category_id": 1, "poly": [372.036865234375, 322.95660400390625, 1339.638427734375, 322.95660400390625, 1339.638427734375, 524.1068115234375, 372.036865234375, 524.1068115234375], "score": 0.9999949336051941}, {"category_id": 0, "poly": [373.96697998046875, 1724.97021484375, 864.5093383789062, 1724.97021484375, 864.5... | {"preproc_blocks": [{"type": "text", "bbox": [133, 116, 482, 188], "lines": [{"bbox": [133, 117, 480, 129], "spans": [{"bbox": [133, 117, 480, 129], "score": 1.0, "content": "is associated with a Boolean variable and has two outgoing edges low and high. Given", "type": "text"}], "index": 0}, {"bbox": [133, 130, 481, 14... | ./arxiv_full_mineru_outputs_20/images/0704.1394_3.png | images/0704.1394_3.png | |
0704.1394.pdf | 4 | binary encoding $$\overline{{v_{0}\ldots v_{k_{i}-1}}}$$ denoted as $$v_{0}\dots\cdot v_{k_{i}-1}=e n c(j)$$ . Also, every combina-
tion of Boolean values $$v_{0}\ldots v_{k_{i}-1}$$ represents some integer $$j\,\leq\,2^{k_{i}}\,-\,1$$ , denoted as
$$j=d e c(v_{0}\ldots v_{k_{i}-1})$$ . Hence, atomic proposition $$x_{i... | <p>binary encoding $$\overline{{v_{0}\ldots v_{k_{i}-1}}}$$ denoted as $$v_{0}\dots\cdot v_{k_{i}-1}=e n c(j)$$ . Also, every combina-
tion of Boolean values $$v_{0}\ldots v_{k_{i}-1}$$ represents some integer $$j\,\leq\,2^{k_{i}}\,-\,1$$ , denoted as
$$j=d e c(v_{0}\ldots v_{k_{i}-1})$$ . Hence, atomic proposition $$x... | [{"type": "text", "coordinates": [133, 116, 482, 188], "content": "binary encoding $$\\overline{{v_{0}\\ldots v_{k_{i}-1}}}$$ denoted as $$v_{0}\\dots\\cdot v_{k_{i}-1}=e n c(j)$$ . Also, every combina-\ntion of Boolean values $$v_{0}\\ldots v_{k_{i}-1}$$ represents some integer $$j\\,\\leq\\,2^{k_{i}}\\,-\\,1$$ , deno... | [{"type": "text", "coordinates": [133, 117, 201, 130], "content": "binary encoding", "score": 1.0, "index": 1}, {"type": "inline_equation", "coordinates": [201, 118, 250, 128], "content": "\\overline{{v_{0}\\ldots v_{k_{i}-1}}}", "score": 0.91, "index": 2}, {"type": "text", "coordinates": [251, 117, 297, 130], "content... | [] | [{"type": "inline", "coordinates": [201, 118, 250, 128], "content": "\\overline{{v_{0}\\ldots v_{k_{i}-1}}}", "caption": ""}, {"type": "inline", "coordinates": [298, 117, 388, 128], "content": "v_{0}\\dots\\cdot v_{k_{i}-1}=e n c(j)", "caption": ""}, {"type": "inline", "coordinates": [229, 131, 277, 140], "content": "v... | [] | [612.0, 792.0] | [{"type": "text", "text": "", "page_idx": 4}, {"type": "text", "text": "Let the solution space $S o l$ over ordered set of variables $x_{0}<...<x_{k-1}$ be represented by a Binary Decision Diagram $B(V,E,X_{b},R,v a r)$ , where $V$ is the set of nodes $u$ , $E$ is the set of edges $e$ and $X_{b}=\\{0,1,\\ldots,|X_{b}|-... | [{"category_id": 0, "poly": [373.8478698730469, 1418.5523681640625, 808.2520141601562, 1418.5523681640625, 808.2520141601562, 1456.020751953125, 373.8478698730469, 1456.020751953125], "score": 0.9999933242797852}, {"category_id": 1, "poly": [371.24005126953125, 1483.1373291015625, 1340.4417724609375, 1483.1373291015625... | {"preproc_blocks": [{"type": "text", "bbox": [133, 116, 482, 188], "lines": [{"bbox": [133, 117, 480, 130], "spans": [{"bbox": [133, 117, 201, 130], "score": 1.0, "content": "binary encoding", "type": "text"}, {"bbox": [201, 118, 250, 128], "score": 0.91, "content": "\\overline{{v_{0}\\ldots v_{k_{i}-1}}}", "type": "in... | ./arxiv_full_mineru_outputs_20/images/0704.1394_4.png | images/0704.1394_4.png | |
0704.1394.pdf | 5 | assignment $$\rho\,=\,\rho_{o l d}\cup\{(x,v)\}$$ . For every variable $$x_{i}\ \in\ X$$ , old valid domains are
denoted as $$D_{i}^{\rho_{o l d}},i=0,\dots,n-1$$ . and the old BDD $$B^{\rho_{o l d}}$$ is reduced to the restricted
BDD, $$B^{\rho}(V,E,X_{b},v a r)$$ . The $$C V D$$ functionality is to calculate valid do... | <p>assignment $$\rho\,=\,\rho_{o l d}\cup\{(x,v)\}$$ . For every variable $$x_{i}\ \in\ X$$ , old valid domains are
denoted as $$D_{i}^{\rho_{o l d}},i=0,\dots,n-1$$ . and the old BDD $$B^{\rho_{o l d}}$$ is reduced to the restricted
BDD, $$B^{\rho}(V,E,X_{b},v a r)$$ . The $$C V D$$ functionality is to calculate valid... | [{"type": "image", "coordinates": [222, 114, 374, 317], "content": "", "block_type": "image", "index": 1}, {"type": "text", "coordinates": [134, 405, 481, 464], "content": "assignment $$\\rho\\,=\\,\\rho_{o l d}\\cup\\{(x,v)\\}$$ . For every variable $$x_{i}\\ \\in\\ X$$ , old valid domains are\ndenoted as $$D_{i}^{\\r... | [{"type": "text", "coordinates": [134, 406, 181, 419], "content": "assignment", "score": 1.0, "index": 1}, {"type": "inline_equation", "coordinates": [182, 405, 267, 417], "content": "\\rho\\,=\\,\\rho_{o l d}\\cup\\{(x,v)\\}", "score": 0.9, "index": 2}, {"type": "text", "coordinates": [267, 406, 349, 419], "content": ... | [{"coordinates": [222, 114, 374, 317], "index": 0.75, "caption": ".", "caption_coordinates": [133, 337, 482, 360]}] | [{"type": "inline", "coordinates": [182, 405, 267, 417], "content": "\\rho\\,=\\,\\rho_{o l d}\\cup\\{(x,v)\\}", "caption": ""}, {"type": "inline", "coordinates": [350, 405, 385, 416], "content": "x_{i}\\ \\in\\ X", "caption": ""}, {"type": "inline", "coordinates": [178, 417, 275, 429], "content": "D_{i}^{\\rho_{o l d}... | [] | [612.0, 792.0] | [{"type": "image", "img_path": "images/c827050d2d7c81e0316b0dc67490f9975f0e90a2b0029727ecd8c85728ee6723.jpg", "img_caption": ["Fig. 4. BDD of the solution space of the T-shirt example. Variable $\\boldsymbol{x_{i}^{j}}$ denotes bit $v_{j}$ of the Boolean encoding of finite domain variable $x_{i}$ . "], "img_footnote": ... | [{"category_id": 3, "poly": [617.0985107421875, 317.8199157714844, 1040.25, 317.8199157714844, 1040.25, 883.151611328125, 617.0985107421875, 883.151611328125], "score": 0.9999971389770508}, {"category_id": 1, "poly": [374.10205078125, 1613.46337890625, 1337.5048828125, 1613.46337890625, 1337.5048828125, 1709.4497070312... | {"preproc_blocks": [{"type": "image", "bbox": [222, 114, 374, 317], "blocks": [{"type": "image_body", "bbox": [222, 114, 374, 317], "group_id": 0, "lines": [{"bbox": [222, 114, 374, 317], "spans": [{"bbox": [222, 114, 374, 317], "score": 0.9999971389770508, "type": "image", "image_path": "c827050d2d7c81e0316b0dc67490f9... | ./arxiv_full_mineru_outputs_20/images/0704.1394_5.png | images/0704.1394_5.png | |
0704.1394.pdf | 6 | $$C V D-S k i p p e d(B)$$
1: for each $$i=0$$ to $$n-1$$
2: $$L[i]\gets i+1$$
3: $$T\gets T$$ opologicalSor $$t(B)$$
4: for each $$k=0$$ to $$|T|-1$$
5: $$u_{1}\gets T[k],\;\;i_{1}\gets v a r_{1}(u_{1})$$
6: for each $$u_{2}\in A d j a c e n t[u_{1}]$$
7: $$L[i_{1}]\leftarrow m a x\{L[i_{1}],v a r_{1}(u_{2})\}$$
8: $$... | <p>$$C V D-S k i p p e d(B)$$
1: for each $$i=0$$ to $$n-1$$
2: $$L[i]\gets i+1$$
3: $$T\gets T$$ opologicalSor $$t(B)$$
4: for each $$k=0$$ to $$|T|-1$$
5: $$u_{1}\gets T[k],\;\;i_{1}\gets v a r_{1}(u_{1})$$
6: for each $$u_{2}\in A d j a c e n t[u_{1}]$$
7: $$L[i_{1}]\leftarrow m a x\{L[i_{1}],v a r_{1}(u_{2})\}$$
8:... | [{"type": "text", "coordinates": [144, 143, 312, 340], "content": "$$C V D-S k i p p e d(B)$$\n1: for each $$i=0$$ to $$n-1$$\n2: $$L[i]\\gets i+1$$\n3: $$T\\gets T$$ opologicalSor $$t(B)$$\n4: for each $$k=0$$ to $$|T|-1$$\n5: $$u_{1}\\gets T[k],\\;\\;i_{1}\\gets v a r_{1}(u_{1})$$\n6: for each $$u_{2}\\in A d j a c e... | [{"type": "inline_equation", "coordinates": [144, 144, 226, 155], "content": "C V D-S k i p p e d(B)", "score": 0.34, "index": 1}, {"type": "text", "coordinates": [144, 155, 208, 165], "content": "1: for each ", "score": 1.0, "index": 2}, {"type": "inline_equation", "coordinates": [208, 155, 230, 164], "content": "i=0"... | [] | [{"type": "block", "coordinates": [137, 487, 306, 587], "content": "", "caption": ""}, {"type": "inline", "coordinates": [144, 144, 226, 155], "content": "C V D-S k i p p e d(B)", "caption": ""}, {"type": "inline", "coordinates": [208, 155, 230, 164], "content": "i=0", "caption": ""}, {"type": "inline", "coordinates": ... | [] | [612.0, 792.0] | [{"type": "text", "text": "$C V D-S k i p p e d(B)$ \n1: for each $i=0$ to $n-1$ \n2: $L[i]\\gets i+1$ \n3: $T\\gets T$ opologicalSor $t(B)$ \n4: for each $k=0$ to $|T|-1$ \n5: $u_{1}\\gets T[k],\\;\\;i_{1}\\gets v a r_{1}(u_{1})$ \n6: for each $u_{2}\\in A d j a c e n t[u_{1}]$ \n7: $L[i_{1}]\\leftarrow ... | [{"category_id": 1, "poly": [399.7638854980469, 1358.46484375, 846.9850463867188, 1358.46484375, 846.9850463867188, 1632.1768798828125, 399.7638854980469, 1632.1768798828125], "score": 0.9999988079071045}, {"category_id": 1, "poly": [400.410888671875, 398.7509765625, 869.36328125, 398.7509765625, 869.36328125, 946.5875... | {"preproc_blocks": [{"type": "text", "bbox": [144, 143, 312, 340], "lines": [{"bbox": [144, 144, 226, 155], "spans": [{"bbox": [144, 144, 226, 155], "score": 0.34, "content": "C V D-S k i p p e d(B)", "type": "inline_equation", "height": 11, "width": 82}], "index": 0}, {"bbox": [144, 155, 273, 165], "spans": [{"bbox": ... | ./arxiv_full_mineru_outputs_20/images/0704.1394_6.png | images/0704.1394_6.png | |
0704.1394.pdf | 7 | will lead to a node other than $$T_{0}$$ , because then there is at least one satisfying path to $$T_{1}$$
allowing $$x_{i}=j$$ .
T raverse(u,j)
1: $$i\leftarrow v a r_{1}(u)$$
2: $$v_{0},\ldots,v_{k_{i}-1}\leftarrow\ e n c(j)$$
3: $$s\gets v a r_{2}(u)$$
4: if $$M a r k e d[u]=j$$ return $$T_{0}$$
5: $$M a r k e d[u]... | <p>will lead to a node other than $$T_{0}$$ , because then there is at least one satisfying path to $$T_{1}$$
allowing $$x_{i}=j$$ .</p>
<p>T raverse(u,j)
1: $$i\leftarrow v a r_{1}(u)$$
2: $$v_{0},\ldots,v_{k_{i}-1}\leftarrow\ e n c(j)$$
3: $$s\gets v a r_{2}(u)$$
4: if $$M a r k e d[u]=j$$ return $$T_{0}$$
5: $$M a r... | [{"type": "text", "coordinates": [133, 116, 481, 141], "content": "will lead to a node other than $$T_{0}$$ , because then there is at least one satisfying path to $$T_{1}$$\nallowing $$x_{i}=j$$ .", "block_type": "text", "index": 1}, {"type": "text", "coordinates": [144, 159, 307, 303], "content": "T raverse(u,j)\n1: ... | [{"type": "text", "coordinates": [133, 117, 251, 129], "content": "will lead to a node other than", "score": 1.0, "index": 1}, {"type": "inline_equation", "coordinates": [251, 117, 262, 127], "content": "T_{0}", "score": 0.88, "index": 2}, {"type": "text", "coordinates": [263, 117, 469, 129], "content": ", because then... | [] | [{"type": "inline", "coordinates": [251, 117, 262, 127], "content": "T_{0}", "caption": ""}, {"type": "inline", "coordinates": [469, 117, 480, 127], "content": "T_{1}", "caption": ""}, {"type": "inline", "coordinates": [171, 129, 199, 140], "content": "x_{i}=j", "caption": ""}, {"type": "inline", "coordinates": [166, 1... | [] | [612.0, 792.0] | [{"type": "text", "text": "will lead to a node other than $T_{0}$ , because then there is at least one satisfying path to $T_{1}$ allowing $x_{i}=j$ . ", "page_idx": 7}, {"type": "text", "text": "T raverse(u,j) \n1: $i\\leftarrow v a r_{1}(u)$ \n2: $v_{0},\\ldots,v_{k_{i}-1}\\leftarrow\\ e n c(j)$ \n3: $s\\gets v... | [{"category_id": 1, "poly": [400.6529541015625, 442.46826171875, 855.3427734375, 442.46826171875, 855.3427734375, 842.9776000976562, 400.6529541015625, 842.9776000976562], "score": 0.9999912977218628}, {"category_id": 1, "poly": [380.2169189453125, 1424.4461669921875, 1344.227783203125, 1424.4461669921875, 1344.2277832... | {"preproc_blocks": [{"type": "text", "bbox": [133, 116, 481, 141], "lines": [{"bbox": [133, 117, 480, 129], "spans": [{"bbox": [133, 117, 251, 129], "score": 1.0, "content": "will lead to a node other than", "type": "text"}, {"bbox": [251, 117, 262, 127], "score": 0.88, "content": "T_{0}", "type": "inline_equation", "h... | ./arxiv_full_mineru_outputs_20/images/0704.1394_7.png | images/0704.1394_7.png | |
0704.1394.pdf | 8 | 8. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)
9. Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)
10. Subbarayan, S., Jensen, R.M., Hadzic, T., Andersen, H.R., Hulgaard, H., Møller, J.: Com-
paring two implementations of a complete and backtrack-free interactive configurator. In:... | <p>8. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)
9. Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)
10. Subbarayan, S., Jensen, R.M., Hadzic, T., Andersen, H.R., Hulgaard, H., Møller, J.: Com-
paring two implementations of a complete and backtrack-free interactive configurator. ... | [{"type": "text", "coordinates": [133, 116, 483, 228], "content": "8. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)\n9. Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)\n10. Subbarayan, S., Jensen, R.M., Hadzic, T., Andersen, H.R., Hulgaard, H., M\u00f8ller, J.: Com-\nparing two imp... | [{"type": "text", "coordinates": [137, 118, 418, 129], "content": "8. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)", "score": 1.0, "index": 1}, {"type": "text", "coordinates": [136, 129, 376, 140], "content": "9. Dechter, R.: Constraint Processing. Morgan Kaufmann (2003)", "score": 1.0, "ind... | [] | [] | [] | [612.0, 792.0] | [{"type": "text", "text": "", "page_idx": 8}] | [{"category_id": 1, "poly": [372.1245422363281, 322.6958312988281, 1343.9051513671875, 322.6958312988281, 1343.9051513671875, 634.0546875, 372.1245422363281, 634.0546875], "score": 0.9999990463256836}, {"category_id": 2, "poly": [842.81787109375, 1899.3861083984375, 863.6769409179688, 1899.3861083984375, 863.6769409179... | {"preproc_blocks": [{"type": "text", "bbox": [133, 116, 483, 228], "lines": [{"bbox": [137, 118, 418, 129], "spans": [{"bbox": [137, 118, 418, 129], "score": 1.0, "content": "8. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)", "type": "text"}], "index": 0}, {"bbox": [136, 129, 376, 140], "span... | ./arxiv_full_mineru_outputs_20/images/0704.1394_8.png | images/0704.1394_8.png |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.