A novel and robust parameter training approach for HMMs under noisy and partial access to states

Cataloged from PDF version of article.This paper proposes a new estimation algorithm for the parameters of an HMM as to best account for the observed data. In this model, in addition to the observation sequence, we have partial and noisy access to the hidden state sequence as side information. This access can be seen as "partial labeling" of the hidden states. Furthermore, we model possible mislabeling in the side information in a joint framework and derive the corresponding EM updates accordingly. In our simulations, we observe that using this side information, we considerably improve the state recognition performance, up to 70%, with respect to the "achievable margin" defined by the baseline algorithms. Moreover, our algorithm is shown to be robust to the training conditions. (C) 2013 Elsevier B.V. All rights reserved

Borderline gradient continuity for the normalized pp-parabolic operator

In this paper, we prove gradient continuity estimates for viscosity solutions to $\Delta_{p}^N u- u_t= f$ in terms of the scaling critical $L(n+2,1 )$ norm of $f$, where $\Delta_{p}^N$ is the game theoretic normalized $p-$Laplacian operator defined in (1.2) below. Our main result, Theorem 2.5 constitutes borderline gradient continuity estimate for $u$ in terms of the modified parabolic Riesz potential $\mathbf{P}^{f}_{n+1}$ as defined in (2.8) below. Moreover, for $f \in L^{m}$ with $m>n+2$, we also obtain H\"older continuity of the spatial gradient of the solution $u$, see Theorem 2.6 below. This improves the gradient H\"older continuity result in [3] which considers bounded $f$. Our main results Theorem 2.5 and Theorem 2.6 are parabolic analogues of those in [9]. Moreover differently from that in [3], our approach is independent of the Ishii-Lions method which is crucially used in [3] to obtain Lipschitz estimates for homogeneous perturbed equations as an intermediate step.Comment: arXiv admin note: substantial text overlap with arXiv:1904.1307

Pengaruh Faktor Internal dan Eksternal Motivasi terhadap Mutu Pendidikan di Universitas Al Washliyah (UNIVA) Medan

Secara umum penelitian ini bertujuan untuk mengetahui pengaruh motivasi dalam meningkatkan mutu pendidikan di Universitas Al Washliyah (UNIVA) Medan. Penelitian ini termasuk Metode penelitian yang digunakan penulis dalam menyusun laporan tugas akhir ini menggunakan metode deskriptif, yaitu yang mengungkapkan gambaran masalah yang terjadi pada saat penelitian ini berlangsung dan metode kuantitatif, yaitu metode untuk menghitung seberapa besar pengaruh variabel bebas teradap variabel terikatnya. Dalam penelitian ini analisis data yang digunakan adalah analisis jalur dimaksudkan untuk mengetahui adakah pengaruh faktor-faktor internal dan eksternal yang mempengaruhi Perubahan Mutu Pendidikan Universitas Al Washliyah Medan dengan persamaan. Berdasarkan hubungan antar variabel diketahui bahwa ketiga hubungan yang memiliki hubungan yang tidak signifikan yaitu antara Mutu Pendidikan (Y) dengan Faktor Internal (X1), Mutu Pendidikan (Y) dengan Faktor Eksternal (X2) dan Faktor Internal (X1) dengan Faktor Eksternal (X2). Dari aspek variabel Faktor Internal dan Faktor Eksternal secara simultan berpengaruh signifikan terhadap Mutu Pendidikan. Pada uji F, terdapat kecocokan antara model dengan data. Sehingga model analisis jalur yang didapat layak untuk digunakan. Secara parsial koefisien Faktor Internal berpengaruh signifikan terhadap Mutu Pendidikan dan Faktor Eksternal tidak berpengaruh secara signifikan. Pengaruh langsung variabel Faktor Internal (X1) terhadap Mutu Pendidikan (Y) adalah sebesar 0,032041 atau 3,2041% dan pengaruh tidak langsung melalui Faktor Internal (X2) adalah 0,00159847 atau 0,159847% sehingga total pengaruh yang diberikan variabel Faktor Internal (X1) adalah 0,03363947 atau sebesar 3,363947% terhadap Mutu Pendidikan (Y). Ini berarti Faktor Internal memiliki pengaruh yang kecil terhadap Mutu Pendidikan.Pengaruh langsung variabel Faktor Eksternal (X2) terhadap Mutu Pendidikan (Y) adalah sebesar 0,002209 atau 0,2209% dan pengaruh tidak langsung melalui Faktor Internal (X1) adalah 0,00159846 atau 0,159846% sehingga total pengaruh yang diberikan variabel Faktor Eksternal (X2) adalah 0,00380747 atau 0,380747% terhadap Mutu Pendidikan (Y). Ini berarti Faktor Ekstrnal memiliki pengaruh yang besar terhadap Mutu Pendidikan. Nilai R square sebesar 4%, ini menunjukkan bahwa dengan menggunakan model analisis jalur yang didapatkan dimana variabel eksogen yaitu Faktor Internal (X1) dan Faktor Eksternal (X2), memiliki pengaruh terhadap variabel Mutu Pendidikan (Y) sebesar 4%, namun pengaruhnya sangatlah kecil. Sedangkan sisanya (100%-4% = 96%) adalah kemungkinan terdapat aspek-aspek lain yang memiliki pengaruh terhadap Perubahan variabel Mutu Pendidikan (Y). Hal ini sesuai dengan nilai error yang muncul pada path diatas yaitu sebesar 0,63

Complementary approaches to understanding the plant circadian clock

Circadian clocks are oscillatory genetic networks that help organisms adapt to the 24-hour day/night cycle. The clock of the green alga Ostreococcus tauri is the simplest plant clock discovered so far. Its many advantages as an experimental system facilitate the testing of computational predictions. We present a model of the Ostreococcus clock in the stochastic process algebra Bio-PEPA and exploit its mapping to different analysis techniques, such as ordinary differential equations, stochastic simulation algorithms and model-checking. The small number of molecules reported for this system tests the limits of the continuous approximation underlying differential equations. We investigate the difference between continuous-deterministic and discrete-stochastic approaches. Stochastic simulation and model-checking allow us to formulate new hypotheses on the system behaviour, such as the presence of self-sustained oscillations in single cells under constant light conditions. We investigate how to model the timing of dawn and dusk in the context of model-checking, which we use to compute how the probability distributions of key biochemical species change over time. These show that the relative variation in expression level is smallest at the time of peak expression, making peak time an optimal experimental phase marker. Building on these analyses, we use approaches from evolutionary systems biology to investigate how changes in the rate of mRNA degradation impacts the phase of a key protein likely to affect fitness. We explore how robust this circadian clock is towards such potential mutational changes in its underlying biochemistry. Our work shows that multiple approaches lead to a more complete understanding of the clock

Lossless Text Compression Technique Using Syllable Based Morphology

In this paper, we present a new lossless text compression technique which utilizes syllable-based morphology of multi-syllabic languages. The proposed algorithm is designed to partition words into its syllables and then to produce their shorter bit representations for compression. The method has six main components namely source file, filtering unit, syllable unit, compression unit, dictionary file and target file. The number of bits in coding syllables depends on the number of entries in the dictionary file. The proposed algorithm is implemented and tested using 20 different texts of different lengths collected from different fields. The results indicated a compression of up to 43%

Problem representation for refinement

In this paper we attempt to develop a problem representation technique which enables the decomposition of a problem into subproblems such that their solution in sequence constitutes a strategy for solving the problem. An important issue here is that the subproblems generated should be easier than the main problem. We propose to represent a set of problem states by a statement which is true for all the members of the set. A statement itself is just a set of atomic statements which are binary predicates on state variables. Then, the statement representing the set of goal states can be partitioned into its subsets each of which becomes a subgoal of the resulting strategy. The techniques involved in partitioning a goal into its subgoals are presented with examples

Aktivnost arginaze u ovarijskim strukturama krava švicarske smeđe pasmine i njezinih križanaca.

Arginase is the last enzyme of the urea cycle. It catalyses the hydrolysis of L-arginine to L-ornitine and urea. The aim of this study was to investigate the presence of arginase activity in ovarian structures such as: Graaf follicles, GF (Medium and Large size, M- and L-size), Corpus Haemorrhagicum (CH), and various types of Corpus Luteum (CL) such as: cyclic CL (CCL), 2-4 month pregnancy CL (2-4 MCL) and 4-7 month pregnancy CL (4-7 MCL). Ovarian tissues of 62 cows (7-10 years old and Brown Swiss or its cross-breeds), collected from a local slaughterhouse, were used as material. The materials were divided into 6 experimental groups, as follows: MGF group (n = 7), LGF group (n = 21), CH group (n = 7), CCL group (n = 6), 2-4 MCL group (n = 9) and 4-7 MCL group (n = 12). Arginase activities were measured as 0.056 ± 0.017, 0.100 ± 0.016, 2.517 ± 0.521, 0.827 ± 0.190, 0.674 ± 0.106 and 0.833 ± 0.093 U/mg protein in all groups, respectively. Arginase activity in the CH group was significantly higher than that in the CCL, 2-4 MCL and 4-7 MCL groups (P<0.001). The lowest enzyme activity was in the MGF and LGF groups. Hence, it was concluded that the arginase enzyme might play a crucial role in cell division, proliferation and differentiation in the ovarian tissues (especially the CH) of mature cows.Arginaza je posljednji enzim u ciklusu ureje koji katalizira hidrolizu L-arginina u L-ornitin i ureju. Cilj istraživanja bio je utvrditi prisutnost aktivnosti arginaze u ovarijskim strukturama kao što su Graafovi folikuli, GF (srednje veliki - M i veliki - L), corpus haemorrhagicum (CH) i različiti tipovi corpus luteum (CL) kao što su ciklični (CCL), 2-4 mjeseca graviditetni (2-4 MCL) i 4-7 mjeseci graviditetni (4-7 MCL). Tkiva ovarija od 62 krave (švicarske smeđe pasmine i križanaca u dobi od 7 do 10 godina) prikupljena su u lokalnoj klaonici. Materijali su bili podijeljeni u 6 pokusnih skupina kako slijedi: MGF skupina (n = 7), LGF skupina (n = 21), CH skupina (n = 7), CCL skupina (n = 6), 2-4 MCL skupina (n = 9) i 4-7 MCL skupina (n = 12). Slijedom navedenih skupina, aktivnost arginaze bila je 0,056 ± 0,017, 0,100 ± 0,016, 2,517 ± 0,521, 0,827 ± 0,190, 0,674 ± 0,106 i 0,833 ± 0,093 U/mg. Aktivnost arginaze u CH skupini bila je signifikantno viša u odnosu na skupine CCL, 2-4 MCL i 4-7 MCL (P<0,001). Najniža aktivnost enzima bila je u skupinama MGF i LGF. Zaključeno je o mogućoj ključnoj ulozi aktivnosti enzima arginaze u diobi stanica, proliferaciji i diferencijaciji ovarijskih tkiva (osobito CH) kod odraslih krava

Differential, Tissue-specific, Transcriptional Regulation of Apolipoprotein B Secretion by Transforming Growth Factor β

n/

Non-Abelian Antibrackets

The $\Delta$-operator of the Batalin-Vilkovisky formalism is the Hamiltonian BRST charge of Abelian shift transformations in the ghost momentum representation. We generalize this $\Delta$-operator, and its associated hierarchy of antibrackets, to that of an arbitrary non-Abelian and possibly open algebra of any rank. We comment on the possible application of this formalism to closed string field theory.Comment: LaTeX, 8 pages (minor modification

Algorithms for Stable Matching and Clustering in a Grid

We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stably matched to cluster centers, as prioritized by their distances, so that each cluster center is apportioned a set of points of equal area. We show that, for a discretization of the problem to an $n\times n$ grid of pixels with $k$ centers, the problem can be solved in time $O(n^2 \log^5 n)$, and we experiment with two slower but more practical algorithms and a hybrid method that switches from one of these algorithms to the other to gain greater efficiency than either algorithm alone. We also show how to combine geometric stable matchings with a $k$-means clustering algorithm, so as to provide a geometric political-districting algorithm that views distance in economic terms, and we experiment with weighted versions of stable $k$-means in order to improve the connectivity of the resulting clusters.Comment: 23 pages, 12 figures. To appear (without the appendices) at the 18th International Workshop on Combinatorial Image Analysis, June 19-21, 2017, Plovdiv, Bulgari