This paper presents a novel method driven by tree mapping template (TMT) which improve the accuracy of prosodic phrase boundary prediction. The TMT is capable of capturing the isomorphic relation between non-terminal nodes in hierarchical prosodic tree and nodes in binary tree approximation, performing pruning at the decoding phase and revising the baseline maximum entropy model with boosting m...

7 Many parallel processing applications have communication patterns that can be viewed as graphs called k-ary n-cubes, whose special cases include rings, hypercubes and tori. In this paper, 9 combinatorial properties of k-ary n-cubes are examined. In particular, the problem of characterizing the subgraph of a given number of nodes with the maximum edge count is studied. These 11 theoretical res...

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

Discovering new integer sequences and generalizing the existing ones are important and of great interest. In this article, various balanced k-ary trees are first studied and their taxonomy is built. In particular, two systematic balanced k-ary trees, whose nth tree is determined by a certain algorithm, are identified, i.e., complete and sizebalanced k-ary trees. The integer sequences from the f...

In this paper the phase transition, that is to say the transition from a region in which almost all problems have many solutions to a region in which almost all problems have no solution as the constraints become tighter, is investigated by examining n-ary Constraint Satisfaction Problems (CSPs). The paper reports a series of experiments with samples of randomly-generated problems, using a fami...

PSK is a common modulation format in digital communications. The estimation of modulation parameters is necessary for emitter interception in support of numerous military applications. This paper develops the Cramer-Rao Lower Bound for the modulation parameters of a PSK signal. The modulation parameters considered are the carrier frequency, the symbol time and the signal amplitude. The results ...

This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of m and binary low-density parity-check (LDPC) codes, assuming belief propagation decoding on memoryless channels. A concrete framework is presented, admitting systematic searches for new bounds. Two noise measures are considered: the Bhattacharyya noise parameter and the soft bit value for a maximum a post...

This paper focuses on finite-dimensional upper and lower bounds on decodable thresholds of Zm and binary lowdensity parity-check (LDPC) codes, assuming belief propagation decoding on memoryless channels. A concrete framework is presented, admitting systematic searches for new bounds. Two noise measures are considered: the Bhattacharyya noise parameter and the soft bit value for a maximum a post...

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...