All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 15 Next

Displaying 281 – 300 of 407

Showing per page

Stochastic bottleneck transportation problem with flexible supply and demand quantity

Yue Ge, Hiroaki Ishii (2011)

Kybernetika

We consider the following bottleneck transportation problem with both random and fuzzy factors. There exist m supply points with flexible supply quantity and n demand points with flexible demand quantity. For each supply-demand point pair, the transportation time is an independent positive random variable according to a normal distribution. Satisfaction degrees about the supply and demand quantity are attached to each supply and each demand point, respectively. They are denoted by membership functions...

Stochastic Lagrangian method for downscaling problems in computational fluid dynamics

Frédéric Bernardin, Mireille Bossy, Claire Chauvin, Jean-François Jabir, Antoine Rousseau (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

This work aims at introducing modelling, theoretical and numerical studies related to a new downscaling technique applied to computational fluid dynamics. Our method consists in building a local model, forced by large scale information computed thanks to a classical numerical weather predictor. The local model, compatible with the Navier-Stokes equations, is used for the small scale computation (downscaling) of the considered fluid. It is inspired by Pope's works on turbulence, and consists in...

Stock price forecasting: Autoregressive modelling and fuzzy neural network.

Dusan Marcek (2000)

Mathware and Soft Computing

Most models for the time series of stock prices have centered on autoregresive (AR) processes. Traditionaly, fundamental Box-Jenkins analysis [3] have been the mainstream methodology used to develop time series models. Next, we briefly describe the develop a classical AR model for stock price forecasting. Then a fuzzy regression model is then introduced. Following this description, an artificial fuzzy neural network based on B-spline member ship function is presented as an alternative to the stock...

Strategies to scan pictures with automata based on Wang tiles

Violetta Lonati, Matteo Pradella (2011)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Wang automata are devices for picture language recognition recently introduced by us, which characterize the class REC of recognizable picture languages. Thus, Wang automata are equivalent to tiling systems or online tessellation acceptors, and are based like Wang systems on labeled Wang tiles. The present work focus on scanning strategies, to prove that the ones Wang automata are based on are those following four kinds of movements: boustrophedonic, “L-like”, “U-like”, and spirals.

Strategies to scan pictures with automata based on Wang tiles

Violetta Lonati, Matteo Pradella (2011)

RAIRO - Theoretical Informatics and Applications

Wang automata are devices for picture language recognition recently introduced by us, which characterize the class REC of recognizable picture languages. Thus, Wang automata are equivalent to tiling systems or online tessellation acceptors, and are based like Wang systems on labeled Wang tiles. The present work focus on scanning strategies, to prove that the ones Wang automata are based on are those following four kinds of movements: boustrophedonic, “L-like”, “U-like”, and spirals.

Strict maximum separability of two finite sets: an algorithmic approach

Dorota Cendrowska (2005)

International Journal of Applied Mathematics and Computer Science

The paper presents a recursive algorithm for the investigation of a strict,linear separation in the Euclidean space. In the case when sets are linearly separable, it allows us to determine the coefficients of the hyperplanes. An example of using this algorithm as well as its drawbacks are shown. Then the algorithm of determining an optimal separation (in the sense of maximizing the distance between the two sets) is presented.

String Assembling Systems

Martin Kutrib, Matthias Wendlandt (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We introduce and investigate string assembling systems which form a computational model that generates strings from copies out of a finite set of assembly units. The underlying mechanism is based on piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generation is additionally controlled by the requirement that the first symbol of a unit has to be the same as the last symbol of the strand generated so far, as well as by the distinction...

String Assembling Systems

Martin Kutrib, Matthias Wendlandt (2012)

RAIRO - Theoretical Informatics and Applications

We introduce and investigate string assembling systems which form a computational model that generates strings from copies out of a finite set of assembly units. The underlying mechanism is based on piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generation is additionally controlled by the requirement that the first symbol of a unit has to be the same as the last symbol of the strand generated so far, as well as by the distinction...

String distances and intrusion detection: Bridging the gap between formal languages and computer security

Danilo Bruschi, Giovanni Pighizzini (2006)

RAIRO - Theoretical Informatics and Applications

In this paper we analyze some intrusion detection strategies proposed in the literature and we show that they represent the various facets of a well known formal languages problem: computing the distance between a string x and a language L. In particular, the main differences among the various approaches adopted for building intrusion detection systems can be reduced to the characteristics of the language L and to the notion of distance adopted. As a further contribution we will also show that from...

Strong completeness of the Lambek Calculus with respect to Relational Semantics

Szabolcs Mikulás (1993)

Banach Center Publications

In [vB88], Johan van Benthem introduces Relational Semantics (RelSem for short), and states Soundness Theorem for Lambek Calculus (LC) w.r.t. RelSem. After doing this, he writes: "it would be very interesting to have the converse too", i.e., to have Completeness Theorem. The same question is in [vB91, p. 235]. In the following, we state Strong Completeness Theorems for different versions of LC.

Strong functors and interleaving fixpoints in game semantics

Pierre Clairambault (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We describe a sequent calculus μLJ with primitives for inductive and coinductive datatypes and equip it with reduction rules allowing a sound translation of Gödel’s system T. We introduce the notion of a μ-closed category, relying on a uniform interpretation of open μLJ formulas as strong functors. We show that any μ-closed category is a sound model for μLJ. We then turn to the construction of a concrete μ-closed category based on Hyland-Ong game semantics. The model relies on three main ingredients:...

Currently displaying 281 – 300 of 407