Mind wander(ing) (MW) or zoning out is a ubiquitous phenomenon where attention involuntary shifts from task-related processing to task-unrelated thoughts. Unfortunately, MW is a highly internal state so it cannot be readily inferred from overt behaviors and expressions. To help experts investigate mind wanderings, we present a graph-based approach for visual analytics of eye-tracking data, whic...

The rationale of platform-based product configuration has been well recognized for the implementation of mass customization. A product platform refers to the conceptual structure and logical organization of product families from both customer and technical viewpoints. This provides a generic umbrella under which product configuration manifests itself through variant derivation within common pro...

graph theory based methods are powerful means for representing structural systems so that their geometry and topology can be understood clearly. the combination of graph theory based methods and some metaheuristics can offer effective solutions for complex engineering optimization problems. this paper presents a charged system search (css) algorithm for the free shape optimizations of thin-wall...

Let graph energy is a graph--spectrum--based quantity‎, ‎introduced in the 1970s‎. ‎After a latent period of 20--30 years‎, ‎it became a popular topic of research both‎ ‎in mathematical chemistry and in ``pure'' spectral graph theory‎, ‎resulting in‎ ‎over 600 published papers‎. ‎Eventually‎, ‎scores of different graph energies have‎ ‎been conceived‎. ‎In this article we...

Generally, the existing graph-based multi-view clustering models consists of two steps: (1) graph construction; (2) eigen-decomposition on Laplacian matrix to compute a continuous cluster assignment matrix, followed by post-processing algorithm get discrete one. However, both construction and are time-consuming, two-stage process may deviate from directly solving primal problem. To this end, we...

Visual navigation of hierarchically structured graphs is a technique for interactively exploring large graphs that possess an additional hierarchical structure. This structure is expressed in form of a recursive clustering of the nodes: in call graphs of telephone networks, for instance, the nodes are identified with phone numbers; they are clustered recursively through the implicit structure o...

We introduce the Concept→Model→Graph→View Cycle (CMGVC). The CMGVC facilitates coherent architecture analysis, reasoning, insight, and decision making based on conceptual models that are transformed into a generic, robust graph data structure (GDS). GDS is then multiple views of model, which inform stakeholders in various ways. This GDS-based approach decouples view from model constitutes power...

the chromatic number of a graph g, denoted by χ(g), is the minimum number of colors such that g can be colored with these colors in such a way that no two adjacent vertices have the same color. a clique in a graph is a set of mutually adjacent vertices. the maximum size of a clique in a graph g is called the clique number of g. the turán graph tn(k) is a complete k-partite graph whose partition...

Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...

In this paper, we are presenting a novel approach that allows rendering of a dynamic scene in a view-dependent manner. We shall refer to such scene as a view-dependent scene. View-dependence scene is a scene graph which stores the objects of the scene in a hierarchical structure. The objects are stored in the leaves of the graph in a form of viewdependence trees. Our approach does not only allo...