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 8 Next

Displaying 141 – 160 of 195

Showing per page

Frequency planning and ramifications of coloring

Andreas Eisenblätter, Martin Grötschel, Arie M.C.A. Koster (2002)

Discussiones Mathematicae Graph Theory

This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that revolutionizes communication. Traditional vertex coloring provides a conceptual framework for the mathematical modeling of many frequency planning problems. This basic form, however, needs various extensions to cover technical and organizational side constraints. Among these ramifications are T-coloring and...

From Bi-ideals to Periodicity

Jānis Buls, Aivars Lorencs (2008)

RAIRO - Theoretical Informatics and Applications

The necessary and sufficient conditions are extracted for periodicity of bi-ideals. They cover infinitely and finitely generated bi-ideals.

From computing with numbers to computing with words - From manipulation of measurements to manipulation of perceptions

Lotfi Zadeh (2002)

International Journal of Applied Mathematics and Computer Science

Computing, in its usual sense, is centered on manipulation of numbers and symbols. In contrast, computing with words, or CW for short, is a methodology in which the objects of computation are words and propositions drawn from a natural language, e.g., small, large, far, heavy, not very likely, the price of gas is low and declining, Berkeley is near San Francisco, it is very unlikely that there will be a significant increase in the price of oil in the near future, etc. Computing with words is inspired...

From ignorance to uncertainty: a conceptual analysis

Pietro Baroni, Giovanni Guida, Silvano Mussi (1998)

Kybernetika

This paper aims to develop an analysis of how ignorance affects the reasoning activity and is related to the concept of uncertainty. With reference to a simple inferential reasoning step, involving a single piece of relational knowledge, we identify four types of ignorance and show how they give rise to different types of uncertainty. We then introduce the concept of reasoning attitude, as a basic choice about how reasoning should be carried out in presence of ignorance. We identify two general...

From indexed grammars to generating functions

Jared Adams, Eric Freden, Marni Mishna (2013)

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

We extend the DSV method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples.

From Pixels and Minds to the Mathematical Knowledge in a Digital Library

Sojka, Petr, Rákosník, Jiří (2008)

Towards Digital Mathematics Library. Birmingham, United Kingdom, July 27th, 2008

Experience in setting up a workflow from scanned images of mathematical papers into a fully fledged mathematical library is described on the example of the project Czech Digital Mathematics Library DML-CZ. An overview of the whole process is given, with description of all main production steps. DML-CZ has recently been launched to public with more than 100,000 digitized pages.

From the Slit-Island Method to the Ising model: Analysis of irregular grayscale objects

Przemysław Mazurek, Dorota Oszutowska-Mazurek (2014)

International Journal of Applied Mathematics and Computer Science

The Slit Island Method (SIM) is a technique for the estimation of the fractal dimension of an object by determining the area-perimeter relations for successive slits. The SIM could be applied for image analysis of irregular grayscale objects and their classification using the fractal dimension. It is known that this technique is not functional in some cases. It is emphasized in this paper that for specific objects a negative or an infinite fractal dimension could be obtained. The transformation...

Front Matter

(2008)

Towards Digital Mathematics Library. Birmingham, United Kingdom, July 27th, 2008

FSM encoding for BDD representations

Wilsin Gosti, Tiziano Villa, Alex Saldanha, Alberto Sangiovanni-Vincentelli (2007)

International Journal of Applied Mathematics and Computer Science

We address the problem of encoding the state variables of a finite state machine such that the BDD representing the next state function and the output function has the minimum number of nodes. We present an exact algorithm to solve this problem when only the present state variables are encoded. We provide results on MCNC benchmark circuits.

FSP and FLTL framework for specification and verification of middle-agents

Amelia Bădică, Costin Bădică (2011)

International Journal of Applied Mathematics and Computer Science

Agents are a useful abstraction frequently employed as a basic building block in modeling service, information and resource sharing in global environments. The connecting of requester with provider agents requires the use of specialized agents known as middle-agents. In this paper, we propose a formal framework intended to precisely characterize types of middle-agents with a special focus on matchmakers, brokers and front-agents by formally modeling their interactions with requesters and providers....

Full approximability of a class of problems over power sets.

Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi (1981)

Qüestiió

In this paper results concerning structural and approximability properties of the subclass of NP-Complete Optimization Problems, defined over a lattice are considered. First, various approaches to the concept of Fully Polynomial Approximation Scheme are presented with application to several known problems in the class of NP-Complete Optimization Problems.Secondly, a characterization of full Approximability for the class of Max Subset Problems is introduced.

Function approximation of Seidel aberrations by a neural network

Rossella Cancelliere, Mario Gai (2004)

Bollettino dell'Unione Matematica Italiana

This paper deals with the possibility of using a feedforward neural network to test the discrepancies between a real astronomical image and a predefined template. This task can be accomplished thanks to the capability of neural networks to solve a nonlinear approximation problem, i.e. to construct an hypersurface that approximates a given set of scattered data couples. Images are encoded associating each of them with some conveniently chosen statistical moments, evaluated along the x , y axes; in this...

Function operators spanning the arithmetical and the polynomial hierarchy

Armin Hemmerling (2010)

RAIRO - Theoretical Informatics and Applications

A modified version of the classical µ-operator as well as the first value operator and the operator of inverting unary functions, applied in combination with the composition of functions and starting from the primitive recursive functions, generate all arithmetically representable functions. Moreover, the nesting levels of these operators are closely related to the stratification of the arithmetical hierarchy. The same is shown for some further function operators known from computability and complexity theory....

Currently displaying 141 – 160 of 195