Abstract The target cascading methodology for product development is extended to product families with predefined platforms. The single-product formulation is modified to accommodate the presence of shared systems, subsystems, and/or components. Hierarchical optimization problems associated with each product variant are combined to formulate the product family multicriteria design problem, and ...

Existing works on sentiment analysis on product reviews suffer from the following limitations: (1) The knowledge of hierarchical relationships of products attributes is not fully utilized. (2) Reviews or sentences mentioning several attributes associated with complicated sentiments are not dealt with very well. In this paper, we propose a novel HL-SOT approach to labeling a product’s attributes...

We prove that the dimension of bivariate tensor–product spline spaces of bi– degree (d, d) with maximum order of smoothness on a multi–cell domain (more precisely, on a set of cells from a tensor–product grid) is equal to the number of tensor–product B–spline basis functions, defined by only single knots in both directions, acting on the considered domain. A certain reasonable assumption on the...

The Szeged index of a graph G, denoted by S z(G) = ∑ uv=e∈E(G) nu (e)n G v (e). Similarly, the Weighted Szeged index of a graph G, denoted by S zw(G) = ∑ uv=e∈E(G) ( dG(u)+ dG(v) ) nu (e)n G v (e), where dG(u) is the degree of the vertex u in G. In this paper, the exact formulae for the weighted Szeged indices of generalized hierarchical product and Cartesian product of two graphs are obtained.

A hierarchical product model seeks to model network traac as a product of independent on/oo processes. Previous studies have assumed a Markovian structure for component processes amounting to assuming that exponential distributions govern on and oo periods but this is not in good agreement with traac measurements. However, if the number of factor processes grows and input rates are stabilized b...

This paper is geared toward the development of a hierarchical evidential reasoning-based model for manufacturers to determine the relative importance of decision factors for NPD strategy assessments. Incorporated the findings of focus group discussions and interviews with experts in Hong Kong, an assessment model of NPD strategies is devised using the Analytic Hierarchy Process (AHP) and the Ev...

In this paper, the supervisory control of a class of Discrete Event Systems is investigated. Discrete event systems are modeled either by a collection of Finite State Machines that behave asynchronously or by a Hierarchical Finite State Machine. The basic problem of interest is to ensure the invariance of a set of particular configurations in the system. When the system is modeled as asynchrono...

Given a grid in R, consisting of d bi-infinite sequences of hyperplanes (possibly with multiplicities) orthogonal to the d axes of the coordinate system, we consider the spaces of tensor-product spline functions of a given degree on a multi-cell domain. Such a domain consists of finite set of cells which are defined by the grid. A piecewise polynomial function belongs to the spline space if its...

A hierarchical hidden Markov model (HHMM) based approach of product named entity recognition (NER) from Chinese free text is presented in this paper. Characteristics and challenges in product NER is also investigated and analyzed deliberately compared with general NER. Within a unified statistical framework, the approach we proposed is able to make probabilistically reasonable decisions to a gl...

The smallest number of edges that have to be deleted from a graph G to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by φ(G). In this paper our recent results on computing this quantity for hierarchical product of graphs are reported. We also present a fast algorithm for computing edge frustration index of (3, 6)−fullerene graphs.