{"responseHeader":{"status":0,"QTime":5,"params":{"q":"{!q.op=AND}id:\"99674\"","hl":"true","hl.simple.post":"","hl.fragsize":"5000","fq":"!embargo_tdt:[NOW TO *]","hl.fl":"ocr_t","hl.method":"unified","wt":"json","hl.simple.pre":""}},"response":{"numFound":1,"start":0,"docs":[{"file_name_t":"Gu-Parallel_Algorithms.pdf","thumb_s":"/ed/69/ed69566eaf90012a9236decff6d2864ca78a9da0.jpg","oldid_t":"compsci 7787","setname_s":"ir_computersa","restricted_i":0,"format_t":"application/pdf","modified_tdt":"2016-05-25T00:00:00Z","file_s":"/ae/24/ae24121cf0f0fcc66751433e90bc05cb9d3949a9.pdf","title_t":"Page 26","ocr_t":"rnodel. For a CLP model with r relational constraints, there are rn2m2 Boolean label compatibility elements. t.t.2.2 The Graph Representation of CLP For binary constraints, the problem specification of CLP may conveniently and equivalently be represented as a constraint graph,5 or a network of constraints, as shown in Figure 1.1. Unlike a board representation for a CLP which facilitates the computational aspect of CLP, a CLP graph representation uses . visual connectivity to emphasize the local connections between label-pairs, and thus is good for representations such as constraints which operate on the basis of tracing through such connections. In a graph CLP representation, the nodes are the objects to be labeled and the constraints are represented as arcs. The unary constraints are represented by loops on the nodes, while the binary constraints are denoted by directed arcs between a pair of different nodes in the graph (the local connections, i.e., loops and arcs, provide the paths along which labels propagate, and there is no other kind of processing). Each node also has an associated label set (i.e., Li), which gives the possible labels for the object. The set of arcs in the graph is denoted by E and lEI =e. In Figure 1.1 each arc between a pair of nodes may imply a union of at most m directed compatibility values for m label-pairs between node i and node j. In the following definition, we define an extended arc function to uniformly implement this fine-grained directed connectivity for each label-pair between a pair of different nodes. 5This is sometimes called a constraint graph model.","id":99674,"created_tdt":"2016-05-25T00:00:00Z","parent_i":99969,"_version_":1679953745511710721}]},"highlighting":{"99674":{"ocr_t":[]}}}