Page 1

Displaying 1 – 6 of 6

Showing per page

A hierarchical decomposition of decision process Petri nets for modeling complex systems

Julio Clempner (2010)

International Journal of Applied Mathematics and Computer Science

We provide a framework for hierarchical specification called Hierarchical Decision Process Petri Nets (HDPPNs). It is an extension of Decision Process Petri Nets (DPPNs) including a hierarchical decomposition process that generates less complex nets with equivalent behavior. As a result, the complexity of the analysis for a sophisticated system is drastically reduced. In the HDPPN, we represent the mark-dynamic and trajectory-dynamic properties of a DPPN. Within the framework of the mark-dynamic...

A mathematical model for file fragment diffusion and a neural predictor to manage priority queues over BitTorrent

Christian Napoli, Giuseppe Pappalardo, Emiliano Tramontana (2016)

International Journal of Applied Mathematics and Computer Science

BitTorrent splits the files that are shared on a P2P network into fragments and then spreads these by giving the highest priority to the rarest fragment. We propose a mathematical model that takes into account several factors such as the peer distance, communication delays, and file fragment availability in a future period also by using a neural network module designed to model the behaviour of the peers. The ensemble comprising the proposed mathematical model and a neural network provides a solution...

An algorithm for reducing the dimension and size of a sample for data exploration procedures

Piotr Kulczycki, Szymon Łukasik (2014)

International Journal of Applied Mathematics and Computer Science

The paper deals with the issue of reducing the dimension and size of a data set (random sample) for exploratory data analysis procedures. The concept of the algorithm investigated here is based on linear transformation to a space of a smaller dimension, while retaining as much as possible the same distances between particular elements. Elements of the transformation matrix are computed using the metaheuristics of parallel fast simulated annealing. Moreover, elimination of or a decrease in importance...

Approximation of large-scale dynamical systems: an overview

Athanasios Antoulas, Dan Sorensen (2001)

International Journal of Applied Mathematics and Computer Science

In this paper we review the state of affairs in the area of approximation of large-scale systems. We distinguish three basic categories, namely the SVD-based, the Krylov-based and the SVD-Krylov-based approximation methods. The first two were developed independently of each other and have distinct sets of attributes and drawbacks. The third approach seeks to combine the best attributes of the first two.

Currently displaying 1 – 6 of 6

Page 1