Search results for "programming languages"
showing 10 items of 138 documents
Mixture Hidden Markov Models for Sequence Data: The seqHMM Package in R
2019
Sequence analysis is being more and more widely used for the analysis of social sequences and other multivariate categorical time series data. However, it is often complex to describe, visualize, and compare large sequence data, especially when there are multiple parallel sequences per subject. Hidden (latent) Markov models (HMMs) are able to detect underlying latent structures and they can be used in various longitudinal settings: to account for measurement error, to detect unobservable states, or to compress information across several types of observations. Extending to mixture hidden Markov models (MHMMs) allows clustering data into homogeneous subsets, with or without external covariate…
Engineering Topological Nodal Line Semimetals in Rashba Spin-Orbit Coupled Atomic Chains
2019
We study an atomic chain in the presence of modulated charge potential and modulated Rashba spin-orbit coupling (RSOC) of equal period. We show that for commensurate periodicities $\lambda=4 n$ with integer $n$, the three-dimensional synthetic space obtained by sliding the two phases of the charge potential and RSOC features a topological nodal line semimetal protected by an antiunitary particle-hole symmetry. The location and shape of the nodal lines strongly depend on the relative amplitude between the charge potential and RSOC.
RECOGNIZABLE PICTURE LANGUAGES
1992
The purpose of this paper is to propose a new notion of recognizability for picture (two-dimensional) languages extending the characterization of one-dimensional recognizable languages in terms of local languages and alphabetic mappings. We first introduce the family of local picture languages (denoted by LOC) and, in particular, prove the undecidability of the emptiness problem. Then we define the new family of recognizable picture languages (denoted by REC). We study some combinatorial and language theoretic properties of REC such as ambiguity, closure properties or undecidability results. Finally we compare the family REC with the classical families of languages recognized by four-way a…
The Existence of Solutions for Local Dirichlet (r(u),s(u))-Problems
2022
In this paper, we consider local Dirichlet problems driven by the (r(u),s(u))-Laplacian operator in the principal part. We prove the existence of nontrivial weak solutions in the case where the variable exponents r,s are real continuous functions and we have dependence on the solution u. The main contributions of this article are obtained in respect of: (i) Carathéodory nonlinearity satisfying standard regularity and polynomial growth assumptions, where in this case, we use geometrical and compactness conditions to establish the existence of the solution to a regularized problem via variational methods and the critical point theory; and (ii) Sobolev nonlinearity, somehow related to the spac…
Graph-grammar semantics of a higher-order programming language for distributed systems
1994
We will consider a new tiny, yet powerful, programming language for distributed systems, called DHOP, which has its operational semantics given as algebraic graph rewrite rules in a certain category of labeled graphs. Our approach allows to separate actions which affect several processes from local changes such as variable bindings. We also sketch how to derive an implementation from this specification.
Clustering with Terracotta
2008
Masteroppgave i informasjons- og kommunikasjonsteknologi 2008 – Universitetet i Agder, Grimstad In today’s java community, modern enterprise application products have more constraints and requirements then ever. High availability, application scalability and also good performance are required, which means an application is needed to be deployed on multiple JVMs, in other words, it has to be clustered or distributed. It is essential for the application to scale out well, has better performance and less complexity during development of clustering. This master thesis focuses on clustering with Terracotta which is a JVM level clustering technique. First I start analyzing the complexity when an …
"Table 39" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Compilation of multiplicities of tensor mesons from current LEP I data.
"Table 37" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Compilation of multiplicities of scalar mesons from current LEP I data.
"Table 35" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Charged particle multiplicity compiled from current LEP I data.
PASSIM – an open source software system for managing information in biomedical studies
2007
Abstract Background One of the crucial aspects of day-to-day laboratory information management is collection, storage and retrieval of information about research subjects and biomedical samples. An efficient link between sample data and experiment results is absolutely imperative for a successful outcome of a biomedical study. Currently available software solutions are largely limited to large-scale, expensive commercial Laboratory Information Management Systems (LIMS). Acquiring such LIMS indeed can bring laboratory information management to a higher level, but often implies sufficient investment of time, effort and funds, which are not always available. There is a clear need for lightweig…