No description available.

No description available.

No description available.

No description available.

People have been trying to predict the stock marketsince its inception and financial investors have made it theirprofession. What makes predicting the stock market such ahard task is its seemingly random dependency on everythingfrom Elon Musks tweets to future earnings. Machine learninghandles this apparent randomness with ease and we will try itout by implementing a Hidden Markov Model. We will modeltwo different stocks, Tesla, Inc. and Coca-Cola Company, andtry using the forecasted prices as a template for a simple tradingalgorithm. We used an approach of calculating the log-likelihoodof preceding observations and correlated it with the log-likelihoodof all the preceding subsequences of equivalent size by turningthe time window by one day in the past. The results show thatmodeling two stocks of different volatility is possible, but usingthe result as a template for trading came back inconclusive withless than 50 percent successful trades for both of the modelledstocks. / Människor har försökt förutsäga aktiemarknaden sedan starten och finansiella investerare har gjort det till sitt yrke. Det som gör att förutsäga aktiemarknaden till en så svår uppgift är dess till synes slumpmässiga beroende av allt från Elon Musks tweets till framtida intäkter. Maskininlärning hanterar denna uppenbara slumpmässighet med lätthet och vi kommer att testa det genom att implementera en Hidden Markov-modell. Vi kommer att modellera två olika aktier, Tesla, Inc. och Coca-Cola Company, och försöka använda de prognostiserade priserna som bas för en enkel algoritm att handla på. Vi använde ett tillvägagångssätt för att beräkna log-sannolikheten för föregående observationer och korrelerade den med logsannolikheten för alla föregående följder av motsvarande storlek genom att vrida tidsfönstret med en dag tidigare. Resultaten visar att det är möjligt att modellera två aktier med olika volatilitet, men att använda resultatet som en mall för handel kom tillbaka de med mindre än 50 procent framgångsrika affärer för båda modellerna. / Kandidatexjobb i elektroteknik 2021, KTH, Stockholm

<p>This thesis presents the design and implementation of a source code generator for dealing with Bayesian statistics. The specific focus of this case study is to produce usable source code for handling Hidden Markov Models (HMMs) from a Domain Specific Language (DSL).</p> <p>Domain specific languages are used to allow domain experts to design their source code from the perspective of the problem domain. The goal of designing in such a way is to increase the development productivity without requiring extensive programming knowledge.</p> / Master of Applied Science (MASc)

NIBP is a prototype member of a novel protein family. It forms a novel subcomplex of NIK-NIBP-IKKB and enhances cytokine-induced IKKB-mediated NFKB activation. It is also named TRAPPC9 as a key member of trafficking particle protein (TRAPP) complex II, which is essential in trans-Golgi networking (TGN). The signaling pathways and molecular mechanisms for NIBP actions remain largely unknown. The aim of this research is to identify potential proteins interacting with NIBP, resulting in the regulation of NFKB signaling pathways and other unknown signaling pathways. At the laboratory of Dr. Wenhui Hu in the Department of Neuroscience, Temple University, sixteen partner proteins were experimentally identified that potentially bind to NIBP. NIBP is a novel protein with no entry in the Protein Data Bank. From a computational and bioinformatics standpoint, we use prediction of secondary structure and protein disorder as well as homology-based structural modeling approaches to create a hypothesis on protein-protein interaction between NIBP and the partner proteins. Structurally, NIBP contains three distinct regions. The first region, consisting of 200 amino acids, forms a hybrid helix and beta sheet-based domain possibly similar to Sybindin domain. The second region comprised of approximately 310 residues, forms a tetratrico peptide repeat (TPR) zone. The third region is a 675 residue long all beta sheet and loops zone with as many as 35 strands and only 2 helices, shared by Gryzun-domain containing proteins. It is likely to form two or three beta sheet sandwiches. The TPR regions of many proteins tend to bind to the peptides from disordered regions of other proteins. Many of the 16 potential binding proteins have high levels of disorder. These data suggest that the TPR region in NIBP most likely binds with many of these 16 proteins through peptides and other domains. It is also possible that the Sybindin-like domain and the Gryzun-like domain containing beta sheet sandwiches bind to some of these proteins. / Bioengineering

Interpretation of electroencephalograms (EEGs) is a process that is still dependent on the subjective analysis of the examiner. The interrater agreement, even for relevant clinical events such as seizures, can be low. For instance, the differences between interictal, ictal, and post-ictal EEGs can be quite subtle. Before making such low-level interpretations of the signals, neurologists often classify EEG signals as either normal or abnormal. Even though the characteristics of a normal EEG are well defined, there are some factors, such as benign variants, that complicate this decision. However, neurologists can make this classification accurately by only examining the initial portion of the signal. Therefore, in this thesis, we explore the hypothesis that high performance machine classification of an EEG signal as abnormal can approach human performance using only the first few minutes of an EEG recording. The goal of this thesis is to establish a baseline for automated classification of abnormal adult EEGs using state of the art machine learning algorithms and a big data resource – The TUH EEG Corpus. A demographically balanced subset of the corpus was used to evaluate performance of the systems. The data was partitioned into a training set (1,387 normal and 1,398 abnormal files), and an evaluation set (150 normal and 130 abnormal files). A system based on hidden Markov Models (HMMs) achieved an error rate of 26.1%. The addition of a Stacked Denoising Autoencoder (SdA) post-processing step (HMM-SdA) further decreased the error rate to 24.6%. The overall best result (21.2% error rate) was achieved by a deep learning system that combined a Convolutional Neural Network and a Multilayer Perceptron (CNN-MLP). Even though the performance of our algorithm still lags human performance, which approaches a 1% error rate for this task, we have established an experimental paradigm that can be used to explore this application and have demonstrated a promising baseline using state of the art deep learning technology. / Electrical and Computer Engineering

yes / This paper describes a technique for automatic recognition of off-line printed Arabic text using Hidden Markov Models. In this work different sizes of overlapping and non-overlapping hierarchical windows are used to generate 16 features from each vertical sliding strip. Eight different Arabic fonts were used for testing (viz. Arial, Tahoma, Akhbar, Thuluth, Naskh, Simplified Arabic, Andalus, and Traditional Arabic). It was experimentally proven that different fonts have their highest recognition rates at different numbers of states (5 or 7) and codebook sizes (128 or 256). Arabic text is cursive, and each character may have up to four different shapes based on its location in a word. This research work considered each shape as a different class, resulting in a total of 126 classes (compared to 28 Arabic letters). The achieved average recognition rates were between 98.08% and 99.89% for the eight experimental fonts. The main contributions of this work are the novel hierarchical sliding window technique using only 16 features for each sliding window, considering each shape of Arabic characters as a separate class, bypassing the need for segmenting Arabic text, and its applicability to other languages.

The goal of this thesis is to enable a robot to actively collaborate with a person to move an object in an efficient, smooth and robust manner. For a robot to actively assist a person it is key that the robot recognizes the actions or phases of a collaborative tasks. This requires the robot to have the ability to estimate a person’s movement intent. A hurdle in collaboratively moving an object is determining whether the partner is trying to rotate or translate the object (the rotation versus translation problem). In this thesis, Hidden Markov Models (HMM) are used to recognize human intent of rotation or translation in real-time. Based on this recognition, an appropriate impedance control mode is selected to assist the person. The approach is tested on a seven degree-of-freedom industrial robot, KUKA LBR iiwa 14 R820, working with a human partner during manipulation tasks. Results show the HMMs can estimate human intent with accuracy of 87.5% by using only haptic data recorded from the robot. Integrated with impedance control, the robot is able to collaborate smoothly and efficiently with a person during the manipulation tasks. The HMMs are compared with a switching function based approach that uses interaction force magnitudes to recognize rotation versus translation. The results show that HMMs can predict correctly when fast rotation or slow translation is desired, whereas the switching function based on force magnitudes performs poorly.