Nauki Techniczne

Theoretical and Applied Informatics


Theoretical and Applied Informatics | 2012 | vol. 24 | No 4 |


The predicted annual growth of energy consumption in ICT by 4% towards 2020, despite improvements and efficiency gains in technology, is challenging our ability to claim that ICT is providing overall gains in energy efficiency and Carbon Imprint as computers and networks are increasingly used in all sectors of activity. Thus we must find means to limit this increase and preserve quality of service (QoS) in computer systems and networks. Since the energy consumed in ICT is related to system load, ]this paper discusses the choice of system load that offers the best trade-off between energy consumption and QoS. We use both simple queueing models and measurements to develop and illustrate the results. A discussion is also provided regarding future research directions.
Przejdź do artykułu

Autorzy i Afiliacje

Erol Gelenbe
Ricardo Lent


The problem that this paper investigates, namely, optimization of overlay computing systems, follows naturally from growing need for effective processing and consequently, fast development of various distributed systems. We consider an overlay-based computing system, i.e., a virtual computing system is deployed on the top of an existing physical network (e.g., Internet) providing connectivity between computing nodes. The main motivation behind the overlay concept is simple provision of network functionalities (e.g., diversity, flexibility, manageability) in a relatively cost-effective way as well as regardless of physical and logical structure of underlying networks. The workflow of tasks processed in the computing system assumes that there are many sources of input data and many destinations of output data, i.e., many-to-many transmissions are used in the system. The addressed optimization problem is formulatedin the form of an ILP (Integer Linear Programing) model. Since the model is computationally demanding and NP-complete, besides the branch-and-bound algorithm included in the CPLEX solver, we propose additional cut inequalities. Moreover, we present and test two effective heuristic algorithms: tabu search and greedy. Both methods yield satisfactory results close to optimal.
Przejdź do artykułu

Autorzy i Afiliacje

Krzysztof Walkowiak
Andrzej Kasprzak
Karol Andrusieczko


In wireless mobile networks, a client can move between different locations while staying connected to the network and access the remote server over the mobile networks by using their mobile de- vices at anytime and anywhere. However, the wireless network is more prone to some security attacks, as it does not have the ingrained physical security like wired networks. Thus, the client authentication is required while accessing the remote server through wireless network. Based on elliptic curve cryptosystem (ECC) and identity-based cryptography (IBC), Debiao et al. proposed an ID-based client authentication with key agreement scheme to reduce the computation and communication loads on the mobile devices. The scheme is suitable for mobile client-server environments, is secure against different attacks and provides mutual authentication with session key agreement between a client and the remote server as they claimed. Unfotunately, this paper demonstrates that Debiao et al.’s scheme is vulnerable some cryptographic attacks, and proposed an improved ID-based client authentication with key agreement scheme using ECC. The proposed scheme is secure based on Elliptic Curve Discrete Logarithm Problem (ECDLP) and Computational Diffie-Helmann Problem (CDHP). The detail analysis shows that our scheme overcomes the drawbacks of Debiao et al.’s scheme and achieves more functionality for the client authentication with lesser computational cost than other schemes.
Przejdź do artykułu

Autorzy i Afiliacje

Islam S.K. Hafizul
G.P. Biswas


Some data sets contain data clusters not in all dimension, but in subspaces. Known algorithms select attributes and identify clusters in subspaces. The paper presents a novel algorithm for subspace fuzzy clustering. Each data example has fuzzy membership to the cluster. Each cluster is defined in a certainsubspace, but the the membership of the descriptors of the cluster to the subspace (called descriptor weight) is fuzzy (from interval [0,1]) – the descriptors of the cluster can have partial membership to a subspace the cluster is defined in. Thus the clusters are fuzzy defined in their subspaces. The clusters are defined by their centre, fuzziness and weights of descriptors. The clustering algorithm is based on minimizing of criterionfunction. The paper is accompanied by the experimental results of clustering. This approach can be used for partition of input domain in extraction rule base for neuro-fuzzy systems.
Przejdź do artykułu

Autorzy i Afiliacje

Krzysztof Simiński


This paper presents non-linear mathematical model of a computer network with a part of wireless network. The article contains an analysis of the stability of the network based on TCP-DCR, which is a modification of the traditional TCP. Block diagram of the network model was converted to a form in order to investigate the D-stability using the method of the space of uncertain parameters. Robust D-stability is calculated for constant delays values.
Przejdź do artykułu

Autorzy i Afiliacje

Jerzy Klamka
Jolanta Tańcula


Editor-in-Chief: Prof. dr hab. inż. Jerzy Klamka

Managing Editor:
dr hab. Jarosław Miszczak


Theoretical and Applied Informatics Institute of Theoretical and Applied Informatics Polish Academy of Sciences Bałtycka 5, 44-100 Gliwice, Poland Editorial Office Secretary dr hab. Jarosław Miszczak e-mail:

Instrukcje dla autorów

Submissions of a manuscript for publication in TaAI implies that the paper was not previously published (with possible exceptions of selected conference and invited papers) and is not being submitted for publication elsewhere; that permission for publication, if needed, has been granted by appropriate sources; and the first author ensures that other authors have approved the paper for publication.

Manuscripts (in 2 paper copies and electronic copy) should be sent directly to the Editorial Office. All further correspondence, proofs and offprints will be sent to the first author, unless indicated otherwise by the authors.

All papers will be evaluated by one of the Editors and will be reviewed.

Suitability for publication will be judged on the basis of relevance of the paper contents to the overall TaAI aims and scope, its originality, technical quality, importance and readability.

The language of the journal is English (with possible exceptions). The text should be formatted, and appropriate templates (DOC or TeX format) are available at:

Author will receive 10 offprints of published paper without charge.

Authors can receive their paper for a galley proof. Extensive changes of the text in galley proofs are unacceptable; in exceptional cases a note added in a proof can be included at the end of paper. If the proofs are not returned promptly, the article will be proof-read against the manuscript by the publisher and printed without author's corrections.

Editorial Office right is to skip galley proof stage in the process of publication.

Ta strona wykorzystuje pliki 'cookies'. Więcej informacji