Results 31 to 40 of about 332,400 (128)

Simulation of non-Markovian Processes in BlenX [PDF]

open access: yes, 2008
BlenX is a programming language explicitly designed for modeling biological processes inspired by Beta-binders. The actual framework assumes biochemical interactions being exponentially distributed, i.e., an underlying Markov process is associated with ...
Prandi, Davide   +2 more
core  

From Solvable to Executable Models of Biological Systems [PDF]

open access: yes, 2008
Classical modeling approaches for biology are mainly grounded in mathematics, and specifically on ordinary differential equations (ODE). Process calculi-based conceptual and computational tools are an alternative and emergent approach.
Palmisano, Alida, Priami, Corrado
core  

One-Chip Solution to Intelligent Robot Control: Implementing Hexapod Subsumption Architecture Using a Contemporary Microprocessor

open access: yes, 2004
This paper introduces a six-legged autonomous robot managed by a single controller and a software core modeled on subsumption architecture. We begin by discussing the features and capabilities of IsoPod, a new processor for robotics which has enabled a ...
Iwamasa, Ryuichi, Pashenkov, Nikita
core   +2 more sources

Understanding Lua's Garbage Collection -- Towards a Formalized Static Analyzer [PDF]

open access: yesarXiv, 2020
We provide the semantics of garbage collection (GC) for the Lua programming language. Of interest are the inclusion of finalizers(akin to destructors in object-oriented languages) and weak tables (a particular implementation of weak references). The model expresses several aspects relevant to GC that are not covered in Lua's documentation but that ...
arxiv  

On the diameter of hyperbolic random graphs [PDF]

open access: yes42nd International Colloquium on Automata, Languages, and Programming, ICALP 2015, pp. 614--625, 2015
Large real-world networks are typically scale-free. Recent research has shown that such graphs are described best in a geometric space. More precisely, the internet can be mapped to a hyperbolic space such that geometric greedy routing performs close to optimal (Bogun\'a, Papadopoulos, and Krioukov. Nature Communications, 1:62, 2010).
arxiv   +1 more source

TRANSLATOR APPLICATIONS MESSENGER JAVA BASED AND GOOGLE TRANSLATE API [PDF]

open access: yes, 2013
The purpose of this research is to produce a messenger applications such as Messenger Translator Applications. Then test the feasibility of the application as an application that makes it easy to translate language or translator in chat communication ...
Novita, Anindita
core  

Computable de Finetti measures

open access: yes, 2011
We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically rewritten as ...
Aldous   +51 more
core   +3 more sources

Towards Patterns for Heaps and Imperative Lambdas [PDF]

open access: yes, 2015
In functional programming, point-free relation calculi have been fruitful for general theories of program construction, but for specific applications pointwise expressions can be more convenient and comprehensible. In imperative programming, refinement calculi have been tied to pointwise expression in terms of state variables, with the curious ...
arxiv   +1 more source

A C++11 implementation of arbitrary-rank tensors for high-performance computing

open access: yes, 2014
This article discusses an efficient implementation of tensors of arbitrary rank by using some of the idioms introduced by the recently published C++ ISO Standard (C++11). With the aims at providing a basic building block for high-performance computing, a
Aragón, Alejandro M.
core   +1 more source

Analytical modelling in Dynamo [PDF]

open access: yes, 2018
BIM is applied as modern database for civil engineering. Its recent development allows to preserve both structure geometrical and analytical information.
Jasinski, Marcin   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy