Page 1 Next

Displaying 1 – 20 of 232

Showing per page

A branch-and-cut algorithm for a resource-constrained scheduling problem

Renaud Sirdey, Hervé L. M. Kerivin (2007)

RAIRO - Operations Research

This paper is devoted to the exact resolution of a strongly NP-hard resource-constrained scheduling problem, the Process Move Programming problem, which arises in relation to the operability of certain high-availability real-time distributed systems. Based on the study of the polytope defined as the convex hull of the incidence vectors of the admissible process move programs, we present a branch-and-cut algorithm along with extensive computational results demonstrating its practical relevance,...

A chaos-based secure cluster protocol for wireless sensor networks

Qian Fang, Ying Liu, Xiaoqun Zhao (2008)

Kybernetika

Security mechanisms for wireless sensor networks (WSN) face a great challenge due to the restriction of their small sizes and limited energy. Hence, many protocols for WSN are not designed with the consideration of security. Chaotic cryptosystems have the advantages of high security and little cost of time and space, so this paper proposes a secure cluster routing protocol based on chaotic encryption as well as a conventional symmetric encryption scheme. First, a principal-subordinate chaotic function...

A distributed transportation simplex applied to a Content Distribution Network problem

Rafaelli de C. Coutinho, Lúcia M. A. Drummond, Yuri Frota (2014)

RAIRO - Operations Research - Recherche Opérationnelle

A Content Distribution Network (CDN) can be defined as an overlay system that replicates copies of contents at multiple points of a network, close to the final users, with the objective of improving data access. CDN technology is widely used for the distribution of large-sized contents, like in video streaming. In this paper we address the problem of finding the best server for each customer request in CDNs, in order to minimize the overall cost. We consider the problem as a transportation problem...

A mathematical and computational framework for reliable real-time solution of parametrized partial differential equations

Christophe Prud'homme, Dimitrios V. Rovas, Karen Veroy, Anthony T. Patera (2002)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

We present in this article two components: these components can in fact serve various goals independently, though we consider them here as an ensemble. The first component is a technique for the rapid and reliable evaluation prediction of linear functional outputs of elliptic (and parabolic) partial differential equations with affine parameter dependence. The essential features are (i) (provably) rapidly convergent global reduced–basis approximations — Galerkin projection onto a space W N spanned...

A Mathematical and Computational Framework for Reliable Real-Time Solution of Parametrized Partial Differential Equations

Christophe Prud'homme, Dimitrios V. Rovas, Karen Veroy, Anthony T. Patera (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

We present in this article two components: these components can in fact serve various goals independently, though we consider them here as an ensemble. The first component is a technique for the rapid and reliable evaluation prediction of linear functional outputs of elliptic (and parabolic) partial differential equations with affine parameter dependence. The essential features are (i) (provably) rapidly convergent global reduced–basis approximations — Galerkin projection onto a space WN spanned...

A method of constructing the frame of a directed graph

Ichiro Hofuku, Kunio Oshima (2013)

International Journal of Applied Mathematics and Computer Science

In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of the present...

A model of route lifetime optimization with linguistic knowledge in wireless ad-hoc networks.

E. Natsheh, S. Khatun, A. Jantan (2006)

Mathware and Soft Computing

Ad-hoc On-Demand Distance Vector (AODV) routing protocol has been and continues to be a very active and fruitful research protocol since its introduction in the wireless ad-hoc networks. AODV uses a static value for its route lifetime parameter called Active Route Timeout (ART) which indicates the time that the route can stay active in the routing table. Route lifetime may be more accurately determined dynamically via measurement, instead of static value. To accomplish this, the fuzzy logic system...

A RED modified weighted moving average for soft real-time application

Joanna Domańska, Adam Domański, Dariusz R. Augustyn, Jerzy Klamka (2014)

International Journal of Applied Mathematics and Computer Science

The popularity of TCP/IP has resulted in an increase in usage of best-effort networks for real-time communication. Much effort has been spent to ensure quality of service for soft real-time traffic over IP networks. The Internet Engineering Task Force has proposed some architecture components, such as Active Queue Management (AQM). The paper investigates the influence of the weighted moving average on packet waiting time reduction for an AQM mechanism: the RED algorithm. The proposed method for...

A Semantic-Oriented Architecture of a Functional Module for Personalized and Adaptive Access to the Knowledge in a Multimedia Digital Library

Paneva-Marinova, Desislava (2008)

Serdica Journal of Computing

This article presents the principal results of the doctoral thesis “Semantic-oriented Architecture and Models for Personalized and Adaptive Access to the Knowledge in Multimedia Digital Library” by Desislava Ivanova Paneva-Marinova (Institute of Mathematics and Informatics), successfully defended before the Specialised Academic Council for Informatics and Mathematical Modelling on 27 October, 2008.This paper presents dissertation work on semantic-oriented architectures and models for personalized...

A simplex trained neural network-based architecture for sensor fusion and tracking of target maneuvers

Yee Chin Wong, Malur K. Sundareshan (1999)

Kybernetika

One of the major applications for which neural network-based methods are being successfully employed is in the design of intelligent integrated processing architectures that efficiently implement sensor fusion operations. In this paper we shall present a novel scheme for developing fused decisions for surveillance and tracking in typical multi-sensor environments characterized by the disparity in the data streams arriving from various sensors. This scheme employs an integration of a multilayer neural...

Currently displaying 1 – 20 of 232

Page 1 Next