International Scientific Journal of "Computing"

Research Institute of Intelligent Computer Systems

Ternopil National Economic University

2006, Vol. 5, Issue 3


Contents and abstracts

  1. V. Tydnjuk, V. Kravchenko, O. Mul. Naturally Controlled Processes and Theory of Relativity, - pp. 6-14.
  2. A. Tsimbal. The Implementation of Prolog Interpreter: Lexical and Syntax Analyses, - pp. 15-24.
  3. El_Sayed M. Saad, M.M. Hadhoud, M.I. Moawad, M. El_Halawany, A.M. Abbas. A New Symmetry Approach for Frontal-View Face Detection, - pp. 25-34.
  4. P. Iliev, P. Tzvetkov, G. Petrov. Multi Dimensional Dynamic Scene Analysis Using 3D Image Histogram and Entropy Sequences Analysis, - pp. 35-43.
  5. S. Iftene, F. Chelaru. The General Chinese Remainder Theorem, - pp. 44-50.
  6. R. Darevych. Rising of the Text Documents Search Precision by Using the Adaptive Ontology, - pp. 51-58.
  7. R. Beghdad. K-means for Modelling and Detecting Anomalous Profiles, - pp. 59-66.
  8. N. Prevysokova. Analysis of Efficiency the Number-Theoretic Walsh Transform Realization Above the Galois Fields, - pp. 67-74.
  9. A. Kapczynski, P. Kasprowski, P. Kuzniacki. User Authentication Based on Behavioral Patterns, - pp. 75-79.
  10. G. Shilo. Interval Structures And Their Using, - pp. 80-86.
  11. OP Gupta, Karanjeet Singh Kahlon. Performance Evaluation of Grid Enabled PC Cluster, - pp. 87-90.
  12. J. K. Grabara. Power Plant in Abstraction Model Usage for Management, - pp. 91-95.
  13. P. Borovska, S. Bahudaila, M. Lazarova. Island Migration Model with Parallel Mutation Strategies for Computing the Traveling Salesman Problem on Multicomputer Platform, - pp. 96-102.
  14. U. Grossmann, M. Schauch, S. Hakobyan. The Accuracy of Algorithms for WLAN Indoor Positioning and the Standardization of Signal Reception for Different Mobile Devices, - pp. 103-109.

NATURALLY CONTROLLED PROCESSES
AND THEORY OF RELATIVITY

Volodymyr Tydnjuk 1), Volodymyr Kravchenko 2), Olena Mul 3) *

1) International Scientific and Educational Center of Information Technologies and Systems,
40 Academician Glushkov avenue, 03680 Kiev, Ukraine,
vtfly@yandex.ru
2) Institute of Cybernetics named by V. Glushkov,
40 Academician Glushkov avenue, 03680 Kiev, Ukraine
v_kram@i.com.ua
3) Department of Mathematics, University of Aveiro, 3810-193 Aveiro, Portugal
olena@mat.ua.pt
* Grant from FCT (The Portuguese Foundation for Science and Technology), fellowship SFRH/BPD/14946/2004

The new space-time model is proposed instead of the present model in the theories of relativity. The possible mechanism of control of some natural processes by weak space fields is demonstrated. In theoretical aspect it is raised a question about existence of an information signal along the time axis. It is shown also that existence of the maximum velocity of physical interaction propagation follows from the equations of the general relativity theory.

Top


THE IMPLEMENTATION OF PROLOG INTERPRETER:
LEXICAL AND SYNTAX ANALYSES

Alexander Tsimbal

Kharkiv national university of radio electronics,
Kharkiv, Lenin Ave. 14, mcdulcimer@ukr.net

The article considers the development of Prolog programming language interpreter with lexical and syntax analyzer, table control and interpreter blocks. There is proposed the schemes of syntax analyzes and the elements of translator’s program code. The software is developed in Visual C++ 2005 (Beta) environment.

Top


A NEW SYMMETRY APPROACH FOR FRONTAL-VIEW FACE DETECTION

El_Sayed M. Saad 1), Mohiy M. Hadhoud 2), Moawad I. Moawad 3),
Mohamed El_Halawany 3), and Alaa M. Abbas 3)*

1) Faculty of Engineering, Helwan University, Egypt
2) Faculty of Computers and Information, Menoufia University, Egypt
3) Faculty of Electronic Engineering, Menouf, 32952, Menoufia University, Egypt
* Corresponding Author: aladin_abbas@yahoo.com

An efficient algorithm for detecting frontal-view faces in color images is proposed. The proposed algorithm has a special task; it detects faces in the presence of skin-tone regions (human body, clothes, and background) Firstly, a pixel based color classifier is applied to segment the skin pixels from background. Next, a hybrid cluster algorithm is applied to partition the skin region. We introduce a new symmetry approach, which is the main distinguishing feature of the proposed algorithm. It measures a symmetrical value, searches for the real center of the region, and then removes the extra unsymmetrical skin pixels. The cost functions are adopted to locate the real two eyes of the candidate face region. A template matching process is preformed between an aligning frontal face model and the candidate face region as a verification step. Experimental results reveal that our algorithm can perform the detection of faces successfully under wide variations.

Top


MULTI DIMENSIONAL DYNAMIC SCENE ANALYSIS USING 3D IMAGE
HISTOGRAM AND ENTROPY SEQUENCES ANALYSIS

Panayot Iliev 1), Plamen Tzvetkov 2), George Petrov 3)

1) New Bulgarian University, Department of Telecommunications, 21 Montevideo Str,
1618 Sofia, Bulgaria.Tel: (++359 2) 811 0609, e-mail: piliev@nbu.bg
2) Technical University of Sofia, Department of Electrical Measurement, 1000 Sofia,
Bulgaria.Tel: (++359 2) 965 2159, Fax:(++359 2) 965 2447, e-mail: tzvetcov@tu-sofia.bg
3) New Bulgarian University, Department of Telecommunications, 21 Montevideo
Str, 1618 Sofia, Bulgaria. Tel: (++359 2) 811 0609, e-mail: gpetrov@nbu.bg

This paper presents an unconventional approach for motion detection using 3D image histogram sequence analysis. The idea of this approach is to remove the process of motion estimation into the field of 3D image histogram sequences by analysis of their statistical characteristics. A functional and statistical model of a system for motion detection has been created. The experimental results prove that the relationship between statistical characteristics of the 3D image histograms sequences and process of motion estimation is a guarantee for creating a reliable and high precision motion detection system as well as for image compression using 3D entropy functions analysis. Such a system can be used for security control of banks, airports, military objects, embassies, shops etc.

Top


THE GENERAL CHINESE REMAINDER THEOREM

Sorin Iftene 1), Florin Chelaru 2)

1) Faculty of Computer Science, "Al. I. Cuza" University, Iasi, Romania
e-mail: siftene@infoiasi.ro
2) Faculty of Computer Science, "Al. I. Cuza" University, Iasi, Romania
e-mail: florin.chelaru@infoiasi.ro

The Chinese remainder theorem deals with systems of modular equations. The classical variant requires the modules to be pairwise coprime. In this paper we discuss the general variant, which does not require this restriction on modules. We have selected and implemented several algorithms for the general Chinese remainder theorem. Moreover, we point out some interesting applications of this variant in secret sharing and threshold cryptography.

Top


RISING OF THE TEXT DOCUMENTS SEARCH PRECISION BY USING
THE ADAPTIVE ONTOLOGY

Romana Darevych

Chief of scientific-organizational department of Karpenko Physico-Mechanical Institute of NASU
Naukova str., 5, Lviv, 79601 darevych@ipm.lviv.ua

Conceptual graphs are an effective tool for representation of the semantic content of text documents and domain ontology as well. In this article the new method of evaluation of text documents content similarity is proposed. The method consists in representation compared texts as its weighted conceptual graphs supplemented by related context from domain ontology and estimation of a distance between semantic weights centers of these graphs. It is shown that the method satisfies axioms of a metric. Procedures of the automatic tuning of ontology to the specified domain and information needs of user are developed. The results of experiment shows that the taking into account semantics of the used concepts, assertions and significance coefficients from adaptive ontology during the text processing rises the search precision on average 20 %.

Top


K-MEANS FOR MODELLING AND DETECTING ANOMALOUS PROFILES

Rachid Beghdad

Faculty of sciences, 12 boulevard Bouaouina, Bejaia 06000, Algeria
e-mail: rbeghdad@yahoo.fr

We introduce an intrusion detection method based on the K-means (KM) clustering method to detect anomalous users’ profiles. The main idea is to define k centroids, one for each cluster, such that each cluster represents a given user profile. These centroids should be placed as much as possible far away from each other. The next step is to take each point belonging to a given data set and associate it to the nearest centroid. When no point is pending, the first step is completed and an early groupage is done. At this point we need to re-calculate k new centroids as barycenters of the clusters resulting from the previous step. After we have these k new centroids, a new binding has to be done between the same data set points and the nearest new centroid. A loop has been generated. As a result of this loop we may notice that the k centroids change their location step by step until no more changes are done. An example and experiments are described to illustrate the robustness of our approach.

Top


ANALYSIS OF EFFICIENCY THE NUMBER-THEORETIC WALSH
TRANSFORM REALIZATION ABOVE THE GALOIS FIELD

Natalia Prevysokova

Precarpathian National University,
Shevchenka st. 57, Ivano-Frankivsk, Ukraine, 76025
e-mail: natvolo@rambler.ru

It is set possibility machine realization the Walsh transform above the Galois fields with presentation of information and implementation arithmetic operations in the Galois code systems. The speed of devices of implementation of arithmetic operations for the Walsh - Galois transformation is analysed. It is set and analyzed complication of it’s apparatus realization in the binary system and in the Galois -code.

Top


USER AUTHENTICATION BASED ON BEHAVIORAL PATTERNS

Adrian Kapczynski 1), Pawel Kasprowski 2), Piotr Kuzniacki 3)

1) Silesian University of Technology, adrian.kapczynski@polsl.pl, www.biometrics.pl
2) Silesian University of Technology, pawel.kasprowski @polsl.pl, www.kasprowski.pl
3) Silesian University of Technology, piotr.kuzniacki@polsl.pl, www.kuzniacki.net

In this paper biometric techniques based on eye movement and keystroke dynamics were examined. In the first part theoretical aspects concerning biometrics were presented. In second part two prototype systems were characterized: first based on eye movement dynamics and the second based on keystroke dynamics. In the third part chosen system was taken into testing which quantitative effects were presented in categories of FRR, FAR and HTER indicators.

Top


INTERVAL STRUCTURES AND THEIR USING

Galina Shilo

PhD, Ass. Prof., Zaporizhzhya national technical university
Zhukovsky Str. 64, Zaporizhzhya, Ukraine, 69063
e-mail: gshilo@zntu.edu.ua

Properties of interval structures with floating intervals, scopes and linked intervals are explored. For the evaluation of regions of change of interval parameters of elements and sizes of the external influencing branchy interval structures are offered. The methods of transformation of interval structures and their application in the tasks of choice of elements of electronic vehicles are considered.

Top


PERFORMANCE EVALUATION OF GRID ENABLED PC CLUSTER

OP Gupta 1), Karanjeet Singh Kahlon 2)

1) Faculty of Computer Science, Punjab Agricultural University, Ludhiana, 141004 India, opgupta@gmail.com 2) Department of Computer Science, Guru Nanak Dev University, Amritsar, India, karankahlon@yahoo.com

A new era of modern computing ushered in early forties. This new concept demanded more and more computing power as the day past. It was assistance to solve large complex problems. Supercomputing has witnessed a paradigm shift from massively parallel supercomputers to network computers. Though dedicated high end supercomputers still have their place in the market yet combined unused CPU cycles of desktop PCs available in the campus network can form comparable virtual supercomputers. Consequently, distributed computing attracted a boost of attention and becoming one of the most promising areas of large scale scientific computing. Local Area Network (LAN) consists of different clusters of high end desktop PCs.

These clusters are geographically distributed over the campus wide network and called local grid of clusters. In this paper, we are presenting Grid-enabled PC Cluster (GPCC), exhibiting low latency and high bandwidth subcommunication system. The design of the GPCC is such that it keeps in view the TCP windows buffer size of local1 and non-local2 nodes in the network environment.

Top


POWER PLANT IN ABSTRACTION MODEL USAGE FOR MANAGEMENT

Janusz Krzysztof Grabara

Faculty of Mangement, Czestochowa University of Technology
Armii Krajowej 19B, 42-200 Czestochowa, Poland
grabara@zim.pcz.czest.pl

Power plant structure can be introduced in different ways. One of such ways is the tables used is structural analysis, which take into consideration organisational and technological divisions or determine directions of technical development in enterprise with use of simulation methods. All methods that optimise management decisions can be introduced as right structural models.

It is necessary to think whether for Management System there is possibility to create universal structure, which allows building management structure model. The model has to fulfill certain requirement at the same time as simple as possible to implement to management computer system as a module of integrated system.

The paper it is a trial of theoretical introducing of such model, which take into consideration streams of management system elements and decisions and their interactions. This model consists of matrix mutual connections of the system elements and decisions.

Top


ISLAND MIGRATION MODEL WITH PARALLEL MUTATION STRATEGIES
FOR COMPUTING THE TRAVELING SALESMAN PROBLEM ON
MULTICOMPUTER PLATFORM

Plamenka I. Borovska 1), Subhi A. Bahudaila 2), Milena K. Lazarova 3)

1) Technical University of Sofia, 8 boul. “Kliment Ohridsky”, 1756 Sofia, Bulgaria
pborovska@tu-sofia.bg, http://www.tu-sofia.bg/Bul/faculties/fksu/ks/leader_eng.htm 2) Technical University of Sofia, 8 boul. “Kliment Ohridsky”, 1756 Sofia, Bulgaria, subhudail@yahoo.com
3) Technical University of Sofia, 8 boul. “Kliment Ohridsky”, 1756 Sofia, Bulgaria, milaz@tu-sofia.bg

This paper investigates the efficiency of a model of parallel genetic computation of the traveling salesman problem with circular periodic chromosomes migration. The parallel model is verified by MPI-based program implementation on a multicomputer platform. The correlation of the application and architectural spaces has been investigated by exploring the impact of the scalability of the application and the parallel machine size over the efficiency of the parallel system. Performance profiling, evaluation and analysis have been made for different numbers of cities and different sizes of the multicomputer platform. The paper also investigates the impact of the mutation strategy on the solution quality of coarse-grained parallel genetic algorithm with circular periodic migration for the traveling salesman problem. We propose an approach to improve the quality of solution by applying parallel variable mutation rates for the local evolutions in the concurrent processes. A series of experiments has been carried out with parallel fixed and variable mutation rates in order to estimate the efficiency of the suggested approach. The best quality solutions have been obtained for the strategy with parallel fixed mutation rates.

Top


THE ACCURACY OF ALGORITHMS FOR WLAN INDOOR POSITIONING
AND THE STANDARDIZATION OF SIGNAL RECEPTION FOR
DIFFERENT MOBILE DEVICES

Uwe Grossmann, Markus Schauch, Syuzanna Hakobyan

Business Department, Dortmund University of Applied Sciences
Emil-Figge-Strasse 44, 44227 Dortmund, Germany
uwe.grossmann@fh-dortmund.de, markus.schauch@fh-dortmund.de, syuzanna.hakobyan@fh-dortmund.de
www.ikaros-projekt.de

Often mobile devices like mobile phones or personal digital assistants (PDA) are equipped with IEEE 802.11 WLAN adapters. Furthermore, within many buildings a WLAN infrastructure is available. The aim of this work is to investigate the quality of different indoor positioning methods based on values of WLAN received signal strength index (RSSI) using commercially available devices (mobile phones, PDA). Three positioning algorithms were considered: minimal Euclidian distance, intersections of RSSI-Isolines and a stochastic model based on Bayes' theorem. Two measuring testbeds, a museum's exhibition room and an empty seminar room, four different types of PDA (Dell, Fujitsu, HP, T-Mobile) and two types of access points (Netgear, Lancom) were used.

Results show that positioning can be achieved with an average accuracy of approx. 2-3 metres. WLAN capable mobile devices behave differently in receiving RSSI values of a base station. For reasons of standardization a linear correlation between different receiving levels of PDA was investigated.

Top