Gesture-based interaction has long been seen as a natural means of input for electronic presentation systems; however, gesture-based presentation systems have not been evaluated in real-world contexts, and the implications of this interaction modality are not known. This thesis describes the design and evaluation of Maestro, a gesture-based presentation system which was developed to explore these issues. This work is presented in two parts. The first part describes Maestro's design, which was informed by a small observational study of people giving talks; and Maestro's evaluation, which involved a two week field study where Maestro was used for lecturing to a class of approximately 100 students. The observational study revealed that presenters regularly gesture towards the content of their slides. As such, Maestro supports several gestures which operate directly on slide content (e.g., pointing to a bullet causes it to be highlighted). The field study confirmed that audience members value these content-centric gestures. Conversely, the use of gestures for navigating slides is perceived to be less efficient than the use of a remote. Additionally, gestural input was found to result in a number of unexpected side effects which may hamper the presenter's ability to fully engage the audience. The second part of the thesis presents a gesture recognizer based on discrete hidden Markov models (DHMMs). Here, the contributions lie in presenting a feature set and a factorization of the standard DHMM observation distribution, which allows modeling of a wide range of gestures (e.g., both one-handed and bimanual gestures), but which uses few modeling parameters. To establish the overall robustness and accuracy of the recognition system, five new users and one expert were asked to perform ten instances of each gesture. The system accurately recognized 85% of gestures for new users, increasing to 96% for the expert user. In both cases, false positives accounted for fewer than 4% of all detections. These error rates compare favourably to those of similar systems.

Pairwise sequence alignment is a fundamental problem in bioinformatics with wide applicability. This thesis presents three new algorithms for this well-studied problem. First, we present a new algorithm, RDA, which aligns sequences in small segments, rather than by individual bases. Then, we present two algorithms for aligning long genomic sequences: CAPE, a pairwise global aligner, and FEAST, a pairwise local aligner. RDA produces interesting alignments that can be substantially different in structure than traditional alignments. It is also better than traditional alignment at the task of homology detection. However, its main negative is a very slow run time. Further, although it produces alignments with different structure, it is not clear if the differences have a practical value in genomic research. Our main success comes from our local aligner, FEAST. We describe two main improvements: a new more descriptive model of evolution, and a new local extension algorithm that considers all possible evolutionary histories rather than only the most likely. Our new model of evolution provides for improved alignment accuracy, and substantially improved parameter training. In particular, we produce a new parameter set for aligning human and mouse sequences that properly describes regions of weak similarity and regions of strong similarity. The second result is our new extension algorithm. Depending on heuristic settings, our new algorithm can provide for more sensitivity than existing extension algorithms, more specificity, or a combination of the two. By comparing to CAPE, our global aligner, we find that the sensitivity increase provided by our local extension algorithm is so substantial that it outperforms CAPE on sequence with 0.9 or more expected substitutions per site. CAPE itself gives improved sensitivity for sequence with 0.7 or more expected substitutions per site, but at a great run time cost. FEAST and our local extension algorithm improves on this too, the run time is only slightly slower than existing local alignment algorithms and asymptotically the same.

The purpose of this study has been to examine a few Swedish advertisment producers opinions on the subject of viral advertising and especially the ethical aspects of hidden viral advertising. The specified purpose of this paper is to: To clarify the underlying reasons for the use of viral advertising. To clarify the advertising producers ethical views on hidden viral advertising. The essay is based on a qualitive research metod of an abductive nature where the empirical data is derived from interviews with three advertisment producers. Through a stratified selection method we contacted agencies that in one way or another uses digital solutions as an advertisment method. All interviews were conducted via the digital chat room Skype, one of the interviews were conducted with both picture and sound and the other two with audio-only. The following points are the essential conclusions of our study: Hidden viral advertising is seen as a rare promotional method in Sweden today, however, the viral-spread effect is more commonly used. The economic factors together with the spreading capacity of the viral advertising is contributing to one of the biggest reasons behind the use of viral advertising. In addition to these, viral advertising is seen as an effective way to stand out from traditional advertising. Viral advertising where the sender is hidden or unclear is always seen as unethical. It is not seen as unethical to spread advertisements through social media as long as the sender is apparent. To produce viral advertising with the intent of generating effective spread is seen as ethically acceptable as long as the sender is apparent. The openness of the Internet creates an opportunity for the consumer to criticice questionable advertising unimpeded, this means that hidden viral advertisment is not seen as a sustainable approach in the long run.

In this thesis, a Mandarin toponym speech recognition system is developed using MFCC, LPC and HMM under Red Hat Linux 9.0. The system is based on monosyllable HMM's to select the initial toponym candidates, and its final classification result can be obtained by further pitch identification mechanisms. For speaker-dependent case, a 90% correct rate can be achieved approximately and the recognition process can be accomplished within 1.5 seconds on the average.

No description available.

There are a lot of difficulties that have to be overcome in the speaker-independent (S.I.) phrase recognition system . And the feasibility of accurate ,real-time and robust system pose of the greatest challenges in the system. In this thesis ,the speaker-independent phase recognition system is based on Hidden Markov Model (HMM). HMM has been proved to be of great value in many applications, notably in speech recognition. HMM is a stochastic approach which characterizes many of the variability in speech signal. It applys the state-of-the-art approach to Automatic Speech Recognition .

A design of speech recognition system for Chinese names has been established in this thesis. By identifying surname first, that is an unique feature of the Chinese names, the classification accuracy and computational time of the system can be greatly improved. This research is primarily based on hidden Markov model (HMM), a technique that is widely used in speech recognition. HMM is a doubly stochastic process describing the ways of pronumciation by recording the state transitions according to the time-varing properties of the speech signal. The results of the HMM are compared with those of the segmental probability model (SPM) to figure out better option in recognizing base-syllables. Under the conditions of equal segments, SPM not only suits Mandarin base-syllable structure, but also achieves the goal of simplifying system since it does not need to find the best transformation of the utterance. A speaker-independent 3000 Chinese names recognition system has been implemented based on the Mandarin microphone database recorded in the laboratory environment.

We build a two-pass Mandarin Automatic Speech Recognition (ASR) decoder on mobile device (PDA). The first-pass recognizing base syllable is implemented by discrete Hidden Markov Model (HMM) with time-synchronous, tree-lexicon Viterbi search. The second-pass dealing with language model, pronunciation lexicon and N-best syllable hypotheses from first-pass is implemented by Weighted Finite State Transducer (WFST). The best word sequence is obtained by shortest path algorithms over the composition result. This system limits the application in travel domain and it decouples the application of acoustic model and the application of language model into independent recognition passes. We report the real-time recognition performance performed on ASUS P565 with a 800MHz processor, 128MB RAM running Microsoft Window Mobile 6 operating system. The 26-hour TCC-300 speech data is used to train 151 acoustic model. The 3-minute speech data recorded by reading the travel-domain transcriptions is used as the testing set for evaluating the performances (syllable, character accuracies) and real-time factors on PC and on PDA. The trained bi-gram model with 3500-word from BTEC corpus is used in second-pass. In the first-pass, the best syllable accuracy is 38.8% given 30-best syllable hypotheses using continuous HMM and 26-dimension feature. Under the above syllable hypotheses and acoustic model, we obtain 27.6% character accuracy on PC after the second-pass.

ITC/USA 2013 Conference Proceedings / The Forty-Ninth Annual International Telemetering Conference and Technical Exhibition / October 21-24, 2013 / Bally's Hotel & Convention Center, Las Vegas, NV / The transition of telemetry from link-based to network-based architectures opens these systems to new security risks. Tools such as intrusion detection systems and vulnerability scanners will be required for emerging telemetry networks. Intrusion detection systems protect networks against attacks that occur once the network boundary has been breached. An intrusion detection model was developed in the Wireless Networking and Security lab at Morgan State University. The model depends on network traffic being filtered into traffic streams. The streams are then reduced to vectors. The current state of the network can be determined using Viterbi analysis of the stream vectors. Viterbi uses the output of the Hidden Markov Model to find the current state of the network. The state information describes the probability of the network being in predefined normal or attack states based on training data. This output can be sent to a network administrator depending on threshold levels. In this project, a penetration-testing tool called Metasploit was used to launch attacks against systems in an isolated test bed. The network traffic generated during an attack was analyzed for use in the MSU intrusion detection model.

This thesis investigates the topology and geometry of hyperbolic knot complements that are commensurable with other knot complements. In chapter 3, we provide an infinite family examples of hyperbolic knot complements commensurable with exactly two other knot complements. In chapter 4, we exhibit an obstruction to knot complements admitting exceptional surgeries in conjunction with hidden symmetries. Finally, in chapter 5, we discuss the role of surfaces embedded in 3-orbifolds as it relates to hidden symmetries. / text