The Experts below are selected from a list of 79563 Experts worldwide ranked by ideXlab platform

Hiroshi Hosobe - One of the best experts on this subject based on the ideXlab platform.

  • a simplex based scalable Linear Constraint solver for user interface applications
    International Conference on Tools with Artificial Intelligence, 2011
    Co-Authors: Hiroshi Hosobe
    Abstract:

    We propose a scalable algorithm called HiRise2 for incrementally solving soft Linear Constraints over real domains. It is based on a framework for soft Constraints, known as Constraint hierarchies, to allow effective modeling of user interface applications by using hierarchical preferences for Constraints. HiRise2 introduces LU decompositions to improve the scalability of an incremental simplex method. Using this algorithm, we implemented a Constraint solver. We also show the results of experiments on the performance of the solver.

  • a scalable Linear Constraint solver for user interface construction
    Lecture Notes in Computer Science, 2000
    Co-Authors: Hiroshi Hosobe
    Abstract:

    This paper proposes an algorithm for satisfying systems of Linear equality and inequality Constraints with hierarchical strengths or preferences. Basically, it is a numerical method that incrementally obtains the LU decompositions of Linear Constraint systems. To realize this, it introduces a novel technique for analyzing hierarchical systems of Linear Constraints. In addition, it improves performance by adopting techniques that utilize the sparsity and disjointness of Constraint systems. Based on this algorithm, the HiRise Constraint solver has been designed and implemented for the use of constructing interactive graphical user interfaces. This paper shows that HiRise is scalable up to thousands of simultaneous Constraints in real-time execution.

Yong Feng - One of the best experts on this subject based on the ideXlab platform.

  • on ranking functions for single path Linear Constraint loops
    International Journal on Software Tools for Technology Transfer, 2020
    Co-Authors: Yong Feng
    Abstract:

    Program termination is a fundamental research topic in program analysis. In this paper, we present a new complete polynomial-time method for the existence problem of Linear ranking functions for single-path loops described by a conjunction of Linear Constraints, when variables range over the reals (or rationals). Unlike existing methods, our method does not depend on Farkas’ Lemma and provides us with counterexamples to existence of Linear ranking functions, when no Linear ranking function exists. In addition, we extend our results established over the rationals to the setting of the integers. This deduces an alternative approach to deciding whether or not a given SLC loop has a Linear ranking function over the integers. Finally, we prove that the termination of bounded single-path Linear-Constraint loops is decidable over the reals (or rationals).

  • the l depth eventual Linear ranking functions for single path Linear Constraint loops
    Theoretical Aspects of Software Engineering, 2016
    Co-Authors: Guang Zhu, Yong Feng
    Abstract:

    Termination of loop programs has received extensive attention in these years. In this paper, we focus on the termination of single-path Linear Constraint loops. For single-path Linear Constraint loops which have no Linear ranking functions or eventual Linear ranking functions, we present a complete method to detect the existence of l-depth eventual Linear ranking functions. Our method extends the work of Bagnara and Mesnard. The prototype of our method has been implemented and the effectiveness of our method has been shown by experimental results.

Jiahui Huang - One of the best experts on this subject based on the ideXlab platform.

  • group Constraint relations for five point amplitudes in gauge theories with so n and sp 2n groups
    Nuclear Physics, 2021
    Co-Authors: Jiahui Huang
    Abstract:

    Abstract Linear Constraint relations among loop-order five-point color-ordered amplitudes in S O ( N ) and S p ( 2 N ) gauge theories are derived with the group-theoretic method. These constrains are derived up to four-loop order. It is found that in both theories, there are n = 6 , 22 , 34 , 44 , 50 Linear Constraint relations at L = 0 , 1 , 2 , 3 , 4 loop orders. Then the numbers of independent color-ordered five-point amplitudes under group-theoretic Constraints are respectively n i n d . = 6 , 12 , 22 , 34 , 50 . We find that the number of independent color-ordered amplitudes begins to diverge from S U ( N ) at four-loop order. This provides an evidence on the argument that group-theoretic Constraint relations depend on properties of group algebras. Some comments are given on future study along this direction.

  • group Constraint relations for five point amplitudes in gauge theories with so n and sp 2n groups
    arXiv: High Energy Physics - Theory, 2017
    Co-Authors: Jiahui Huang
    Abstract:

    In this paper,Linear Constraint relations among loop-order five-point color-ordered amplitudes in $SO(N)$ and $Sp(2N)$ gauge theories are derived with the group-theoretic method. These constrains are derived up to four-loop order. It is found that in both theories, there are $n=6,22,34,44,50$ Linear Constraint relations at $L=0,1,2,3,4$ loop orders. Then the numbers of independent color-ordered five-point amplitudes are respectively $n_{ind.}=6,12,22,34,50$ at each loop order.

Wenchang Shi - One of the best experts on this subject based on the ideXlab platform.

  • detecting multiphase Linear ranking functions for single path Linear Constraint loops
    International Journal on Software Tools for Technology Transfer, 2021
    Co-Authors: Yue Yuan, Wenchang Shi
    Abstract:

    Single-path Linear-Constraint loops are important since many analyses in different fields can be reduced to termination proof synthesis for such loops. In 2017, Ben-Amram and Genaim provided a complete polynomial-time solution to the problem of existence and of synthesis of multiphase Linear ranking functions ($$M\varPhi \hbox {RFs}$$) of bounded depth to prove the termination of a single-path Linear-Constraint loop. However, an open question whether one can precompute a bound on the depth of a $$M\varPhi \hbox {RF}$$ for a given loop is raised and the solution has not been accomplished so far. In this paper, we propose an approach to depth bound detection and synthesis of $$M\varPhi \hbox {RFs}$$ for rational single-path Linear-Constraint loops. We take a step further based on the work of Ben-Amram and Genaim, and detect the depth bound for a certain class of rational single-path Linear-Constraint loops. Furthermore, the effectiveness of our approach is presented with experimental evidence. The depth bound can be precomputed for loops where existing tools fail to infer a $$M\varPhi \hbox {RF}$$ or prove that none exists.

Hai Zhou - One of the best experts on this subject based on the ideXlab platform.

  • Linear Constraint graph for floorplan optimization with soft blocks
    International Conference on Computer Aided Design, 2008
    Co-Authors: Jia Wang, Hai Zhou
    Abstract:

    In this paper, we propose the Linear Constraint graph (LCG) as an efficient general floorplan representation. For n blocks, an LCG has at most 2n+3 vertices and at most 6n+2 edges. Operations with direct geometric meanings are developed to perturb the LCGs. We apply the LCGs to the floorplan optimization with soft blocks to leverage its advantage in terms of the sizes of the graphs, which will improve the efficiency of solving a complex mathematical program in the inner loop of the optimization that decide the block shapes without introducing overlaps to the non-slicing floorplans. Experimental results confirm that the LCGs are effective and efficient.

  • Linear Constraint graph for floorplan optimization with soft blocks
    International Conference on Computer Aided Design, 2008
    Co-Authors: Jia Wang, Hai Zhou
    Abstract:

    In this paper, we propose the Linear Constraint graph (LCG) as an efficient general floorplan representation. For n blocks, an LCG has at most 2n+3 vertices and at most 6n+2 edges. Operations with direct geometric meanings are developed to perturb the LCGs. We apply the LCGs to the floorplan optimization with soft blocks to leverage its advantage in terms of the sizes of the graphs, which will improve the efficiency of solving a complex mathematical program in the inner loop of the optimization that decide the block shapes without introducing overlaps to the non-slicing floorplans. Experimental results confirm that the LCGs are effective and efficient.

  • ICCAD - Linear Constraint graph for floorplan optimization with soft blocks
    2008 IEEE ACM International Conference on Computer-Aided Design, 2008
    Co-Authors: Jia Wang, Hai Zhou
    Abstract:

    In this paper, we propose the Linear Constraint graph (LCG) as an efficient general floorplan representation. For n blocks, an LCG has at most 2n+3 vertices and at most 6n+2 edges. Operations with direct geometric meanings are developed to perturb the LCGs. We apply the LCGs to the floorplan optimization with soft blocks to leverage its advantage in terms of the sizes of the graphs, which will improve the efficiency of solving a complex mathematical program in the inner loop of the optimization that decide the block shapes without introducing overlaps to the non-slicing floorplans. Experimental results confirm that the LCGs are effective and efficient.