Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. Multiway versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm. Software - Practice and Experience, 23(5):529-566, 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and then they propagate values through the constraints according to the ordering (this is called executing) Unfortunately, the local propagation algorithms lost generality so they can only be applied to special sets of constraints and comparators. The local propagation algorithms DeltaBlue [13], SkyBlue [12] QuickPlan [15] DETAIL [10] Houria [8] can solve only equality constraints, e.g. linear equations over reals. The exception is the Indigo algorithm [3] for solving inequalities that combines local propagation and refining method. We borrowed the main idea behind the Indigo ....

Sannella, M., Freeman-Benson, B., Maloney, J., Borning,A., Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm, in Software-- Practice and Experience, Vol. 23 No. 5, pp. 529-566, 1993.

....algorithm based on Skyblue [13] 14] 19] a domain independent solver able to maintain a hi erarchy of multi way, multi output dataflow constraints. The main drawback of such a local propagation algorithm is the limitation to acyclic onstraint graphs. However, as noted by Sannella et al. [21], cyclic constraint networks are seldom encountered in the construction of user interfaces, and limiting the constraint solver to graphs without cycles gives enough efficiency and flexibility to create highly responsive complex interactive systems. In VB, introducing at runtime a constraint that ....

Sannella M, Maloney J, Freeman Benson B, Borning A (1992) Multi-way versus One-way Constraints in user-Interface Construction. Software Practice and Expe- rience 23(5): 529-566.

....to be fulfilled; there, it is a distinction between required constraints which must be satisfied and preferred ones with lower level priorities. It performs local propagation; however, no soft relaxation is possible the constraints will get deleted completely; please consult [Maloney, 1991] [Sannella et al. 1993], and [Sannella, 1994] w.r.t. further developments. Darses, 1990] already mentions (there on p. 135) that an increasing number of CAD systems have been developed from the constraint satisfaction paradigm ; it proposes a least commitment strategy along with an ordering of the constraints ....

Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm. Software---Practice and Experience, 23(5):529--566, May 1993. A Wiley-Interscience Publication. 29

....interface and algorithm animation. The primary tasks of the planning phase of DeltaBlue are method selections. In this paper, weprove that DeltaUp, which is a modification of DeltaBlue, minimizes the number of method selections in every planning phase. 1 Introduction The DeltaBlue algorithm[1, 2] is known as a fast incremental constraint solver based on local propagation and is widely used for constructing graphical user interface and algorithm animation. DeltaBlue has two phases for constraint solving: the planning phase in which method selections are made and the execution phase in ....

....the modified DeltaUp minimizes the number of method selections in every planning phase of DeltaBlue. The organization of the rest of this paper is as follows. We presentabrief description of DeltaUp followed by the proof and our conclusion. We assume that the readers are familiar with DeltaBlue [1, 2]. 2 The DeltaUp Constraint Solver We define a cost function up cost and add the computation of the cost function to two procedures add constraint and remove constraint of DeltaBlue. The two procedures are procedures for the incremental modification of a solution graph, namely, the planning ....

M. Sannella, J. Maloney, Bjorn N. Freeman-Benson, and Alan Borning. Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm. Software--Practice and Experience, 23(5):529--566, May1993.

....virtual calls, incl. interface non virtual calls javac, 1.0.2 compile Richards 20,000 6,997,379 3.91 1.35 javadoc, 1.0.2 gen. html documentation of class 4,000 9,557,012 3.97 1.13 RayTracer render 200x200 picture [18] 3,546 1,999,281,260 12.6 0. 70 DeltaBlue 2 way constraint solver [20] 1,127 856,625 7.10 1.12 Richards1 operating system simulator: six different versions implementing the same functionality but increasingly using the object oriented features of Java 407 5,145,123 2.96 0.65 Richards2 389 6,012,841 3.62 0.56 Richards3 453 7,188,798 5.91 0.79 ....

Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm. Software---Practice and Experience, 23(5), p. 529-566, May 1993.

....constraints that introduce inequalities or hierarchical dependencies, are mainly due to limits of the algorithms used for constraint solution maintenance (see below) neither inequalities nor cyclic constraints are allowed. 4.2. 2 Implementation The Madeus spatial formatter is based on DeltaBlue [17]. This constraint solver uses a local propagation technique for providing efficient and incremental consistency checking. The result is very interesting for authors because they can adjust the position of objects in a very precise way: constraints are continuously maintained when objects are ....

....needs to have some information to anticipate further manipulations. Since we have to handle cyclic constraints and inequalities, finding algorithms which meet these three requirements is a difficult task. Global approaches like [18] have not enough good time performances, local approaches like [17] cannot manage cycles and inequalities neither anticipation. Ad hoc algorithms currently used in Madeus are based on oversimplified hypotheses and could not be easily extended, in particular to meet the stability criterion. Problems encountered with spatial constraints are similar to those ....

SANNELLA M., MALONEY J., FREEMAN-BENSON B. and BORNING A., Multi-way versus one way constraints in user interfaces: Experiences with the Deltablue algorithm, Software Practice and Experience, 23(5), 1993.

.... useful system since a broad class of problems can be described in terms of questions about paths through graphs including shortest paths and regular expression evaluation [3] solutions of dataflow equations for compiler optimizations [21] code generation [2] constraints for graphics systems [17, 23], and most problems that can be naturally posed as dynamic programs [7] On the other hand, if the performance or memory costs of using the declarative library are too large, then it will never be used. This paper examines methods for efficiently evaluating declarative programs. In particular, we ....

Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. Multi-way versus one-way constraints in user interfaces: Experience with the deltablue algorithm. Software--Practice and Experience, 23(5):529--566, May 1993. 14

....of the variables are graphical expressions like x, y coordinates, width, height, etc. In the literature numerous constraint solving algorithms and systems based on constraint solving can be found. Well known systems are given, e.g. by Sketchpad [Sut63] Thinklab and Thinklab II [Bor81, FMB90, SMFB93] Nevertheless, all constraint solvers and algorithms differ with respect to the underlying formalisms according to the following problems. Logical connection of constraints (e.g. conjunction, disjunction) Treatment of cyclic and non directional constraint nets. Treatment of dynamical ....

M. Sannella, J. Maloney, B. Freeman-Benson, and A. Borning. Multi-way versus one-way constraints in user interfaces: Experience with the deltablue algorithm. Software -- Practice and Experience, 23(5):529--566, 1993.

....is reasonable when dealing with a small number of models, but as the number and complexity of models grow there is a need to represent and maintain these constraints explicitly. One way this could be accomplished is through the use of an existing constraint satisfaction algorithm such as DeltaBlue [10]. The use of multiple cameras would provide valuable 3D information that is unavailable from a single camera. However, the model instantiation and manipulation processes become more involved when dealing with multiple input sources. Multiple input sources also raises problems of camera ....

M. Sannella, J. Maloney, B. Freeman-Benson, and A. Borning, "Multi-way versus one-way constraints in user interfaces: Experience with the deltablue algorithm," Tech. Rep. 92-07-05a, Department of Computer Science and Engineering, University of Washington, May 1993.

....systems by constraint hierarchies. The problem is probably hidden in hierarchical constraint solvers which utilize different concepts than traditional constraint satisfaction. Additionally, most current hierarchical constraint solvers are constructed for locally better comparators only [8,9,11,12], and thus they are not suitable for inter hierarchy comparison. Also, if the constraint solvers with intrahierarchy comparison are computational hungry, the solvers supporting inter hierarchy comparison are even more demanding for computational power. Despite the current spare usage of ....

....T14. The other benefit of constraint hierarchies is the possibility to use very weak constraints to establish stability of solution that is crucial for many up to date applications of constraint technology. Currently, this feature is widely used in the construction of graphical user interfaces [11,12]. By stability of the solution we mean as small as possible difference between the original solution and the tuned solution obtained by solving the system of constraints. Constraint hierarchies and inter hierarchy comparison can be succesfully applied to traditional applications, like geometric ....

[Article contains additional citation context not shown here]

Sannella, M., Freeman-Benson, B., Maloney, J., Borning,A., Multi-way versus Oneway Constraints in User Interfaces: Experience with the DeltaBlue Algorithm, Tech. Report 92-07-05, Department of Computer Science and Engineering, University of Washington, July 1992

....advantage of the potential locality of typical constraint networks, e.g. in graphical user interfaces. These algorithms gradually solve constraint hierarchies by selecting uniquely satisfiable constraints repeatedly. Many local propagation algorithms were developed for special purposes (DeltaBlue [18], SkyBlue [17] QuickPlan [20] DETAIL [10] Houria [9] Indigo [5] Our generalized approach to solving constraint hierarchies is also primary based 2 Another method for describing over constrained systems is PCSP (Partial Constraint Satisfaction Problems) 3 In [23] the authors also ....

Sannella, M., Freeman-Benson, B., Maloney, J., Borning,A., Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm, Tech. Report 92-07-05, Department of Computer Science and Engineering, University of Washington, July 1992

....Madeus uses classical spatial constraints such as align, center and shift, on both the vertical and horizontal axes. Once a constraint is set, it holds during the whole presentation, even when the user moves manually some objects on the screen. The Madeus spatial formatter is based on DeltaBlue [13]. Temporal constraints used in Madeus are based on Allen s algebra [1] using the operators EQUALS, STARTS, BEFORE, etc. Basic objects of the scenario are associated with a range of possible durations which can be defined by the author himself or automatically assigned by the system (for ....

SANNELLA M., MALONEY J., FREEMAN-BENSON B., BORNING A., "Multi-way versus one way constraints in user interfaces: Experiences with the Deltablue algorithm", Software Practice and Experience, vol. 23, no. 5, 1993.

....with Garnet s suite of visual programming tools, we expect that some of the initial misconceptions about Lapidary will be eased, thus dampening the learning curve. 9. 3 Constraints A considerable amount of material has been written about one way verus multi way constraints in the literature [38, 11, 44]. Our experiences with applications created using both Lapidary and Garnet is that most relationships which programmers want to express can be written using one way constraints. The remaining relationships that programmers want to express are typically two way relationships (e.g. the value of a ....

Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. "Multi-Way versus One-Way Constraints in User Interfaces: Experiences with the DeltaBlue Algorithm". Software Practice and Experience 23, 5 (1993), 529-566.

....systems by constraint hierarchies. The problem is probably hidden in hierarchical constraint solvers which utilize different concepts than traditional constraint satisfaction. Additionaly, most current hierarchical constraint solvers are constructed for locally better comparators only [8,9,11,12], and thus they are not suitable for inter hierarchy comparison. Also, if the constraint solvers with intra hierarchy comparison are computational hungry, the solvers supporting inter hierarchy comparison are even more demanding for computational power. 4 There exists definition of constraint ....

....planning and propagation. The constraint network is constructed during the planning phase, while the valuation of variables is computed during the propagation phase. We will use the features of the planning phase here. The planning phase is well known from hierarchical constraint solvers DeltaBlue [12] and SkyBlue [11] In [3] we 5 Note, that the hierarchy has no solution if we work with the domain of reals. 10 generalized the planning phase in such a way that all types of constraints and comparators, including globally better, are supported. During the planning phase, each constraint is ....

Sannella, M., Freeman-Benson, B., Maloney, J., Borning,A., Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm, Tech. Report 92-07-05, Department of Computer Science and Engineering, University of Washington, July 1992

....section presents data comparing the performance of running several integer benchmarks on Dynamo to the identical binary executing directly on the processor. Our benchmark set includes the SpecInt95 benchmarks 2 and a commercial C code called deltablue, which is an incremental constraint solver [28]. The programs were compiled at the O2 optimization level (equivalent to the default O option) using the product HP C C compiler. This optimization level includes global intraprocedural optimization. Performance measurements were based on wall clock time on a lightly loaded single processor ....

Sannella, M., Maloney, J., Freeman-Benson, B., and Borning, A. 1993. Multi-way versus one-way constraints in user interfaces: experiences with the Deltablue algorithm. Software -- Practice and Experience 23, 5 (May). 529-566.

....control flow complexity makes their optimization more challenging than relatively regular floating point codes. We show selected SpecInt95 benchmarks running the reference inputs, and a C code called deltablue which is an incremental constraint solver configured to solve 350,000 constraints [Sannella et al. 1993]. The SpecInt95 benchmark gcc is not included in the benchmark set shown here because the SPEC version is actually a script that repeatedly invokes gcc on a number of different inputs. A program must run at least 2 mins on the PA 8000 for Dynamo to be able to provide any performance benefit; ....

Sannella, M., Maloney, J., Freeman-Benson, B., and Borning, A. 1993. Multi-way versus oneway constraints in user interfaces: experiences with the DeltaBlue algorithm. Software -- Practice and Experience 23, 5 (May). 529-566.

No context found.

Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. Multi-way versus oneway constraints in user interfaces: Experience with the DeltaBlue algorithm. Software|Practice and Experience, 23(5):529-566, May 1993.

....of disjunctions of linear constraints. Starting with Sutherland [14] there has been considerable work on developing constraint solving algorithms for supporting direct manipulation in interactive graphical applications. These approaches fall into four main classes: propagation based (e.g. [13, 15]) linear arithmetic solver based (e.g. 3] geometric solver based (e.g. 4, 8] and general non linear optimisation methods such as Newton Rapson iteration (e.g. 5] However, none of these techniques support disjunctive constraints for modelling non overlap. The only work that we know of ....

Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. Multiway versus one-way constraints in user interfaces: Experience with the DeltaBlue algorithm. Software|Practice and Experience, 23(5):529-566, May 1993.

....of the constraint solving algorithm, which currently only allows linear constraints. This limitation is not implicit in the design of CSVG, but is imposed by the solvers used in the current implementation. In particular, we are working on support for arbitrary one way and multi way constraints [34]. For example, a text element in a CSVG document could be constrained to display the coordinates of a circle: moving the circle would update the string, and editing the string would move the circle. Another area for future work is to better describe the semantics of SVG in terms of constraints ....

M. Sannella, J. Maloney, B. Freeman-Benson, and A. Borning. Multi-way versus one-way constraints in user interfaces: Experience with the DeltaBlue algorithm. Software---Practice and Experience, 23(5):529--566, May 1993.

....a set of constraints where each constraint has an associated strength, a constraint solver can leave weaker constraints unsatisfied in order to satisfy stronger constraints. The DeltaBlue algorithm is an incremental algorithm for maintaining constraint hierarchies using local propagation [9, 15]. The ThingLab II user interface development environment was based on DeltaBlue, demonstrating its feasibility for constructing user interfaces [9] However, DeltaBlue has two significant limitations: cycles in the graph of constraints and variables are prohibited (if a cycle is found, the cycle ....

Michael Sannella, John Maloney, Bjorn FreemanBenson, and Alan Borning. Multi-way versus Oneway Constraints in User Interfaces: Experience with the DeltaBlue Algorithm. Software---Practice and Experience, 23(5):529--566, May 1993. 10

....those objects should remain aligned. An important direction for future work is to extend the power of the constraint solving algorithm, which currently only allows linear constraints. In particular, we are working on support for arbitrary one way constraints [27] and multi way constraints [33]. For example, a text element in a CSVG document could be constrained to display the coordinates of a circle: moving the circle would update the string, and editing the string would move the circle. Another area for future work is to better describe the semantics of SVG in terms of constraints ....

Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. Multi-way versus one-way constraints in user interfaces: Experience with the DeltaBlue algorithm. Software---Practice and Experience, 23(5):529--566, May 1993.

....the two subgraphs, they can be solved independently. Within a connected subgraph, the constraints and variables are partitioned into cycles and acyclic local propagation regions, based on the topology of the constraint graph. The local propagation regions are solved using the DeltaBlue algorithm [3, 9]. The local propagation algorithm communicates with the cycle solvers via variables that are shared by the cycle and the local propagation region the information passed back and forth is a value for that variable and a walkabout strength (the strength of the weakest constraint that can be ....

Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. Multi-way versus oneway constraints in user interfaces: Experience with the DeltaBlue algorithm. Software---Practice and Experience, 23(5):529--566, May 1993.

No context found.

Michael Sannella, John Maloney, Bjorn Freeman-Benson, and Alan Borning. Multiway versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm. Software - Practice and Experience, 23(5):529-566, 1993.

No context found.

M. Sannella, J. Maloney, B. N. Freeman-Benson, and A. Borning. Multi-way versus one-way constraints in user interfaces: Experience with the deltablue algorithm. Software - Practice and Experience, 23(5):529--566, 1993.

No context found.

SANNELLA, M., MALONEY, J., FREEMAN-BENSON, B., AND BORNING, A. 1993. Multi-way versus One-way Constraints in User Interfaces: Experience with the DeltaBlue Algorithm. Software---Practice and Experience 23 (5), 529-566.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC