Congenic mouse strains VM/Dk and VM-Sincs7/Dk differ at the Sinc gene, which controls the incubation period of scrapie in mice; VM/Dk mice are Sincp7p7 and VM-Sincs7/Dk mice are Sincs7s7. Restriction fragment length polymorphism and DNA sequencing analysis demonstrated that the PrP genes also differ in these strains, confirming the close genetic linkage of Sinc and PrP. Using the restriction en...

Phonetic decision trees have been widely used for obtaining robust context-dependent models in HMM-based systems. There are five key issues to consider when constructing phonetic decision trees: the alignment of data with the chosen phone classes; the quality of the modeling of the underlying data; the choice of partitioning method at each node; the goodness-of-split criterion and the method fo...

Article history: Received 11 January 2010 Received in revised form 20 December 2010 Accepted 5 July 2011 Available online 28 July 2011 A prominent goal of process mining is to build automatically a model explaining all the episodes recorded in the log of some transactional system. Whenever the process to be mined is complex and highly-flexible, however, equipping all the traces with just one mo...

In this paper, a new clustering technique called Dimensional Split Phonetic Decision Tree (DS-PDT) is proposed. In DSPDT, state distributions are split dimensionally when applying phonetic question. This technique is an extension of the decision tree based acoustic modeling. It gives a proper context-dependent sharing structure of each dimension automatically while maintaining the correlations ...

The state index should encode all context information that might influence the acoustics: the third state of the /t/ in “a tree” should be different from the third state of the /t/ in “a tip,” because they are acoustically different. Likewise, lexical stress, phrase position, glottalization, and dialect might matter. Unfortunately, we never have training examples sufficient to learn the likelih...

We introduce a temporal Steiner network problem in which a graph, as well as changes to its edges and/or vertices over a set of discrete times, are given as input; the goal is to find a minimal subgraph satisfying a set of k time-sensitive connectivity demands. We show that this problem, k-Temporal Steiner Network (k-TSN), is NP-hard to approximate to a factor of k − , for every fixed k ≥ 2 and...

We investigate two context-dependent clustering techniques for content recommendation based on exploration-exploitation strategies in contextual multiarmed bandit settings. Our algorithms dynamically group users based on the items under consideration and, possibly, group items based on the similarity of the clusterings induced over the users. The resulting algorithm thus takes advantage of pref...