We present an algorithm for counting the number of minimum weight spanning trees, based on the fact that the generating function for the number of spanning trees of a given graph, by weight, can be expressed as a simple determinant. For a graph with n vertices and m edges, our algorithm requires O(M(n)) elementary operations, whereM(n) is the number of elementary operations needed to multiply n...

The well-known prediction-error-based maximum likelihood (PEML) method can only handle minimum phase ARMA models. This likelihood (BFML) method, which can handle nonminimum phase and noncausal ARMA models. The BFML method is identical to the PEML method in the case of a minimum phase ARMA model, and it turns out that the BFML method incorporates a noncausal ARMA filter with poles outside the un...

Search for transition structures (TSs) as first-order saddles is one of the most important tasks in theoretical study of chemical reaction. Although automated search has been established either by starting from a local minimum (MIN) or by connecting two MINs, there is no systematic method which can locate TSs of A+B-->X(+Y) type reactions starting from separated reactants. We propose such an ap...

Detecting individual pedestrians in a crowd remains a challenging problem since the pedestrians often gather together and occlude each other in real-world scenarios. In this paper, we first explore how a state-of-the-art pedestrian detector is harmed by crowd occlusion via experimentation, providing insights into the crowd occlusion problem. Then, we propose a novel bounding box regression loss...

The behaviour of the voice source characteristics in connected speech was studied. Voice source parameters were obtained by automatic inverse filtering, followed by automatic fitting of the LF-model to the data. Consistent relations between voice source parameters and prosody were observed.

The famous Padberg–Rao separation algorithm for b-matching polyhedra can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time in the uncapacitated case, and in O(|V ||E|2 log (|V |2/|E|)) time in the capacitated case. We give a new and simple algorithm for the capacitated case which can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time.