Advances in Electrical and Computer Engineering
ISSN 1582-7445 - No 1 / 2002


Journal of the Faculty of Electrical  Engineering
Topics: computers science, control systems, electronics, electrotechnics, drive systems


AIMS AND SCOPE

Advances in Electrical and Computer Engineering, the Electrical Section is the scientific official journal of the Faculty of Electrical Engineering.

The publication policy is to publish high quality original scientific articles and reviews with permission from the Editorial Board. The authors must translate themselves their articles into a foreign language accepted by the UE. It should not have been previously publish and should not be under consideration for publication elsewhere.

The scope of the journal covers: computers science, artificial intelligence, pattern recognition, knowledge engineering, process control theory and applications, distributed systems and computer networks, microcontroller - based industrial networks, electronics, telecommunications, data transmission, software engineering, energy converters, electrotechnics, electric machines modeling and design, control of electric drive systems, non-conventional energy conversion, optimization techniques in electrical power systems, sensors, transducers modeling and design.
 
 
 

Copyright © 2002 Faculty of Electrical Engineering
“Stefan cel Mare” University of Suceava, Romania

All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or other wise, without written permission from the editor.
When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering, the “Stefan cel Mare” University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use. The copyright owner’s consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying.
Disclaimer. Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinion or statement appear in this journal, they wish to make it clear that the data and opinions appearing in the articles, as well as linguistic accuracy, are the sole responsibility of the author.


The papers may be requested by e-mail directly to their authors with respect of the above copyright conditions !



 
 

[TABLE OF CONTENTS]   [Issues on Internet]   [DISTRIBUTION NETWORK] [EDITORIAL BOARD]   [(e)MAIL]

 Advances in Electrical and Computer Engineering
ISSN 1582-7445 - No 1 / 2002


   EDITOR

  Adrian GRAUR   - Dean of the Faculty of Electrical Engineering
 
     ASSOCIATE  EDITORS

  ªtefan Gh. PENTIUC  - Scientific Secretary of the Faculty of Electrical Engineering
  Leon MANDICI   - Head of the Electrotechnique Dept.,Faculty of Electrical Engineering
  Dorel CERNOMAZU  - Faculty of Electrical Engineering
 
     EDITORIAL  BOARD

 Tudor AMBROS   - Chiºinãu Polytechnical Institute - MOLDAVIA
 Dumitru N. ALEXANDRU   - Technical University Iasi
 Jao Paulo BAPTISTA   - Instituto Politecnico do Porto - PORTUGAL
 Oleg BREKHOV   - Moscow Aviation Institute - RUSSIA
 Cristophe CHAILLOU   - Universite des Sciences et Technologies de Lille - FRANCE
 Mihai CRETU   - Technical University Iaºi
 Luc DE BACKER   - Katholieke Hogeschool Sint-Lieven Gent - BELGIUM
 Timothy HALL   - University of Limerick - IRELAND
 Ileana HAMBURG   -Institute for Technology Gelsenkirchen - GERMANY
 Stefan HOLBAN   - "Politehnica" University Timisoara
 Maria G. IOANNIDES   - National Technical University of Athens - GREECE
 Ioan JURCA   - "Politehnica" University Timisoara
 Eleftherios A. KAYAFAS   - National Technical University of Athens - GREECE
 Mykola KIRICHENKO   - Institute of Cybernetics Kiev - UKRAINE
 Valeriu KRAPIVIN   - Moscow Institute of Radioengineering and ELectronics - RUSSIA
 Petru LEONTE   - Technical University Iaºi
 Ioan LETIA   - Technical University Cluj-Napoca
 Vladimir MESYURA   - The State Technical University of Vinnitsa - UKRAINE
 John MILNER   - City University London - GREAT BRITAIN
 Radu MUNTEANU  - Technical University Cluj-Napoca
 Jose OLIVEIRA e SA  - Instituto Politecnico do Porto - PORTUGAL
 Carine NAESSENS  - Katholieke Hogeschool Sint-Lieven Gent - BELGIUM
 Costicã NITU   - University Politehnica Bucureºti
 Adrian PETRESCU   - University Politehnica Bucureºti
 Mircea PETRESCU  - University Politehnica Bucureºti
 Nicola PITRONE  - Universita degli Studi Catania - ITALIA
 Jean Paul SIX   - Université des Sciences et Technologies de Lille - FRANCE
 Fedir SOPRONIUC   - University of Cernãuþi - UKRAINE
 Petru TODOS   - Technical University of Chisinau - MOLDAVIA
 Bernard TOURSEL   - Université des Sciences et Technologies de Lille - FRANCE
 Alexandru VALACHI  - Technical University Iaºi
 

  Back to top



 Advances in Electrical and Computer Engineering
ISSN 1582-7445 - No 1 / 2002

 TABLE OF CONTENTS

FEE Info, Adrian GRAUR
4-5
Information Theory Aspects in Relational Database Design, Mircea PETRESCU 
5-8
Performance Analysis of Checkpointing Schemes in a Multiprocessors Environment, Oleg M. BREKHOV, Saul De La ROSA NIEVES
9-15
Adaptive Scheduling of Tasks in the Conditions of System Overload, Oleg BREKHOV, Dmitry BABAK 
16-22
Development and realization of agglomerative regionalization algorithms and probing of their time complexity, Vladimir MESYURA, Andrew ZAVARZIN
23-27
Knowledge Management and E-Learning, Ileana HAMBURG, Daniel HAMBURG 
28-33
A Distributed Reasoning System for Parallel and Distributed Knowledge-Based Systems, Corneliu NITU 
34-37
Design and Implementation of a Business Process Representation Module, Costin BADICA, Chris FOX
38-45
Effective Algorithms of Rendering Procedure Parallelization for Forming Realistic Images, Alexandr ROMANYUK , Ph.D, Anatolii CHORNIJ
46-50
Problems of Associative Memory Design for Neural Network of Robot Trajectory Planning, Mykola F. KIRICHENKO, Yuriy V. KRAK, Olexandr V. BARMAK
51-56
Efficient Routing Using an Optimal Path Election Parallel Algorithm, Miticã CRAUS, Mihai Horia ZAHARIA, Cristian AMARANDEI 
57-60
Performability of Cellular Manufacturing Systems, Cãlin CIUFUDEAN, George MAHALU, Radu PENTIUC 
61-65
An Experimental Set-Up for Smart Educational Laboratory, Nicola PITRONE
66-68
A Complete Spectral Characterization of some HDBn Codes, Nicolae Dumitru ALEXANDRU, Dimitris VOUKALIS
69-75
Formal Model and Software Tool for Web Site Developing, Vladimir MESYURA, Andrey ZAVARZIN
76-79
Application of the Optimal Uniform Polar Quantization on Complex Reflectivity Function, Zoran H. PERIÆ, Jelena D. JOVKOVIÆ
80-85
Simulation of Switch Box Routing in FPGA, Marius CERLINCA, Adrian GRAUR, Stefan Gheorghe PENTIUC 
86-90

Back to top



 

FEE Info
 
 

20 – 25 May 2002
 
 

The Faculty of Electrical Engineering organized the 9th  Annual International Students’ Computers Contest “HARD & SOFT” Suceava 2002. The contest consisted in realizing an intelligent alarm system based on image processing and using a WebCam connected to the USB port of a PC. The system was exclusively controlled by a PIC based entry module.

Participants: teams from Bucureºti, Timiºoara, Braºov, Iaºi, Suceava, Moscow (Russia), Chiºinãu (Moldova), Novi Sad (Yugoslavia), Chernivtsy (Ukraine).

President of the jury: Professor John MILNER from City University, London.

Prizes awarded to:


The 10th edition of the contest will be held in May 2003.


 
           Adrian GRAUR
    Dean of the Faculty of the Electrical Engineering
  Back to top


INFORMATION  THEORY  ASPECTS  IN  RELATIONAL DATABASE  DESIGN
 

Mircea  PETRESCU,
The University “Politehnica” Bucharest,
Spl. Independentei 313, 77206 Bucharest, Romania.
mirceastelian@yahoo.com
 
 

Abstract. The paper describes the way in which the components of a relational database (attributes, tuples, relation schemes) can be  analysed  in  terms of the information theory. The fact that in a number of tuples of a relation scheme a given attribute has the same value is viewed as a probabilistic event, to which a certain amount of information is associated. On this basis, for describing the “information content” of an attribute the entropy and the information gain of this attribute are introduced. These parameters are calculated using the example of a relation scheme modelling a set of edifices. The attributes in a relation scheme can be ranked, by comparing their entropy and information gain values. It is suggested to extend the above results to the level of a whole relation scheme, or to the level of a group of relation schemes. The approach proposed in the paper is intended to assist the database designer in decisions concerning the content of different relation schemes, beginning with the phase of the conceptual design.
Keywords: database, relation scheme, tuple, attribute, information, information content, entropy, information gain.
 

  Back to top


PERFORMANCE ANALYSIS OF CHECKPOINTING SCHEMES IN A MULTIPROCESSORS ENVIRONMENT
 

Oleg M. BREKHOV and Saul de la ROSA NIEVES
“Moscow State Aviation Institute (Technical University) – MAI”
125871 Moscow, Volokolamskoje chosse, 4
obrekhov@mail.ru        saul7@rambler.ru
 
 

Abstract. In this paper we propose a method for analysing the performance of Checkpointing schemes that use spare processors in their recovery technique, in a fault-tolerant multiprocessor environment. It is assumed that the multiprocessor system consists of a pool of Checkpointing modules that share spare modules for recovery. This method of analysis is bases on studying of the probability of occurrence of different “states” that can appear during the execution of a task. These “states” have as the main variables the availability of the spare module and the number of Checkpointing modules that work simultaneously. In this work we show how this method can be used in several schemes, for example with Roll-Forward Checkpointing Scheme (RFCS) [1] and in Roll-Forward Checkpointing Double Spare Scheme (RFDS) [2].  The results of the analysis of these architectures are compared with the results that we obtain from theirs simulation, and we prove the reliability and universality of our method.
Keywords: Multiprocessor environment, fault-tolerance, Checkpointing, duplex modules, performance analysis.
 
 

  Back to top


ADAPTIVE SCHEDULING OF TASKS IN THE CONDITIONS OF SYSTEM OVERLOAD
 

Oleg BREKHOV, Dmitry BABAK
Moscow State Aviation Institute
(Technical University)
125871, Moscow, GSP, Volokolamskoye shosse, 4,
Dept. "Calculating Machines, Systems and Networks".
obrekhov@rambler.ru, babak-dima@mail.ru
 
 

Abstract. The growing volume and complexity of operating systems dictate the necessity of new approaches to the problem of task planning in real time operating systems. These approaches are implemented on the basis of adaptive mechanisms of quality change, registering of stochastic character of task parameters, application of scheduling schemes with feedback.
This work proposes an online minimization algorithm of task results in real time operating systems possessing adaptive qualities to changes of task quantity, amount of processor load, and distribution of time value of task implementation. The algorithm functions as superstructure to EDF [1] algorithm and clocks in only at overload regime, when processor load becomes higher than 1. The article also provides algorithm realization as a superstructure over basic scheduling means RTOS VxWorks.
Keywords: adaptivity, scheduling, overload
 

  Back to top


DEVELOPMENT AND REALIZATION OF AGGLOMERATIVE REGIONALIZATION ALGORITHMS AND PROBING OF THEIR TIME COMPLEXITY

Vladimir MESYURA
Vinnica Technical State Univercity
vimes@vstu.vinnica.ua
Andrew ZAVARZIN
GIS-Association, Oil and Gaz Institute, Lenin av., 65, GSP-1, Moskow , 117917, Russian Federation
gisa@inbox.ru
 

Abstract. There are a number of mentions in the science literature about the usage of agglomerative hierarchical algorithms for regionalization. Usually, described  algorithms are based on one of the distances between regions in a factor space (for example, group average).
The given article contains generalization of classical classification agglomerative hierarchical algorithms for task of regionalization. In the given article, modes of their realization and the results of experiments under the analysis of their time complexity are described.
Keywords: regionalization, spatial data, agglomerative hierarchical algorithms.
 

 Back to top


KNOWLEDGE MANAGEMENT AND E-LEARNING
 

Ileana HAMBURG
Institut Arbeit und Technik Wissenchaftszentrum Nordrhein-Westfalen,
Gelsenkirchen, Germany
hamburg@iatge.de
Daniel HAMBURG
Gelsenkirchen, Germany
daniel.hamburg@hamburg-consulting.de
 
 

Abstract. This paper presents some aspects of knowledge management (KM) and E-learning, which are two main aspects of the New Economy (NE). KM plays an important role in E-learning processes in order to assure
for the trainees the qualifications needed by the NE because learning is a continuous, cultural process, not only a series of events.The considerations presented in the paper will be applied in two European projects about supporting the integration of disabled people in the NE by qualification.
Keywords: New Economy, knowledge management, E-learning
 

   Back to top


A DISTRIBUTED REASONING SYSTEM FOR PARALLEL AND DISTRIBUTED KNOWLEDGE-BASED SYSTEMS
 

Corneliu NITU
704-1071 Ambleside Dr, Ottawa K2B 6V4 Canada
 
 

Abstract. In this paper, a distributed reasoning system is presented. The final goal is to design a non-specialized knowledge based system that can handle both general and specialized knowledge. The fundamental building blocks of the knowledge base are described. The distributed reasoning algorithm that uses this knowledge base is finally presented.
Keywords: Knowledge representation schema, knowledge-based systems, artificial intelligence, distributed reasoning systems.
 
 

   Back to top


DESIGN AND IMPLEMENTATION OF A BUSINESS PROCESS REPRESENTATION MODULE*
 

Costin BADICA
Department of Computer Science
King's College, Strand, London, WC2R 2LS
badica@dcs.kcl.ac.uk
Chris FOX
Department of Computer Science
University of Essex, Colchester, CO4 3SQ, UK
foxcj@essex.ac.uk
 
 

Abstract. This paper reports on the work done in the INSPIRE project on developing the Process Representation Module (PRM hereafter). The major aim of INSPIRE is the development of a tool to support a more intelligent an human-oriented approach to business process re-engineering (BPR hereafter). Our task was to develop the PRM, which is a core module of the INSPIRE tool. The main responsibility of the PRM is to provide an all-encompassing and consistent representation of business processes ([12]). The paper contains roughly the following information: a description of the architecture and the general idea of the INSPIRE tool; some definitions of key terms related to business processes, as found in the literature; a brief description of some well-known formalisms for business process modelling and of the formalism employed in INSPIRE; architecture and data models for the PRM; details of the PRM design and implementation.
Keywords: business process, software architecture, data model, Prolog programming language
 

   Back to top



 

EFFECTIVE ALGORITHMS OF RENDERING PROCEDURE PARALLELIZATION FOR FORMING REALISTIC IMAGES
 

Alexandr ROMANYUK , Ph.D
Vinnitsa state technical university
 I.Boguna str 119, Vinnitsa, Ukraine
 rom@cec.vstu.vinnica.ua
Anatolii CHORNIJ
Vinnitsa state technical university
I.Bevza str 16/20, Vinnitsa, Ukraine
 

Abstract.  Methods of  rendering procedure  parallelization which use specific feature of  Gouraud and Phong shading have been considered. The distinctive feature of methods consists in absence of multiplication and division operations in cycle of rasterization, that predetermines a simplicity of its hardware representation.
Keywords: rendering, shading, parallelization, real time.
 

   Back to top



 

PROBLEMS OF ASSOCIATIVE MEMORY DESIGN FOR NEURAL NETWORK OF ROBOT TRAJECTORY PLANNING
 

Mykola F. KIRICHENKO                              Yuriy V. KRAK        Olexandr V. BARMAK
 V.M.Gluskov Cybernetics Institute,                          Taras Shevchenko National University
40, Gluskov ave. 03187 Kyiv, Ukraine6,                        Gluskov ave. 03122 Kyiv, Ukraine   kir@dept115.icyb.kiev.ua                                 krak@unicyb.kiev.ua        barmak@svitonline.com
 
 

Abstract. The new mathematical methods of designing associative memory of neural network are considered Definitions of attractor, areas of an attraction and area of an attraction are given. Problems of the analysis of a network and synthesis - necessary, allowable, optimum are formulated. Necessary conditions of existence of attractors, necessary and sufficient conditions of existence attractors and also necessary and sufficient conditions of an accessory of an initial condition of area of an attraction for 1 cycle are resulted. The method is based on general solutions of linear systems. Example of application of proposed methods to problems of robot-manipulator trajectory planning is considered.
Keywords: associative memory, neural network memory, general solution of a linear algebraic system, analysis and synthesis of associative memory, robot-manipulator trajectories planning.
 

   Back to top



 

EFFICIENT ROUTING USING AN OPTIMAL PATH ELECTION PARALLEL ALGORITHM
 

Miticã CRAUS, Mihai Horia ZAHARIA, Cristian AMARANDEI
"Gh.Asachi" Technical University of Iaºi
Computer Engineering Department
53A, Dimitrie Mangeron Blvd, IASI-6600, ROMANIA
craus@cs.tuiasi.ro
 

Abstract. The message routing problem is very important to distributed systems and efficient algorithms to find a solution for this problem are very useful. The most used routing algorithms are dynamic ones. Unfortunately they have a large amount of information to be processed in a short period so a parallel approach can improve their performances. A parallel algorithm for shortest path election is presented and evaluated. A MPI implementation is given and analyzed.
Keywords: routing, distributed systems, parallel algorithms, systolic arrays, MPI
 

   Back to top


PERFORMABILITY OF CELLULAR MANUFACTURING SYSTEMS
 

Cãlin CIUFUDEAN    George MAHALU   Radu PENTIUC
University of Suceava    University of Suceava   University of Suceava
calin@eed.usv.ro   mahalu@eed.usv.ro   radup@eed.usv.ro

Abstract. This paper considers techniques for computing the moments of certain cumulative performance measures over a specified time horizon. We consider a generic cellular manufacturing system with finite buffers and prioritised repair, with multiple repairmen. We use stochastic Petri nets to model the failure-repair behaviour as well as to obtain the performance measures of the cellular manufacturing system. Performability studies are carried out for cellular manufacturing systems, in particular for a two-cell manufacturing system featuring blocking and prioritised centralised repair.
Keywords: automated manufacturing systems, throughput, lead time, stochastic Petri nets.
 

   Back to top


AN EXPERIMENTAL SET-UP FOR SMART EDUCATIONAL LABORATORY
 

Nicola PITRONE
DEES,University of Catania, Viale A. Doria,6    95125 Catania - ITALY
Phone:+39 095 7382309      Fax:+39 095 330793
npitrone@dees.unict.it
 
 

Abstract. Educational tasks usually involve a huge staff of teachers and tutors. This need is extremely emphasised during laboratory session performed by undergraduate students. In recent years some virtual tools allowing for an improvement in laboratory activities have been developed. In this work a quite innovative system to be adopted during laboratory sessions, based on remote controlled devices and hardware/software system, is presented.
Keywords: Remote measurement, virtual systems, educational laboratory.
 

  Back to top


A COMPLETE SPECTRAL CHARACTERIZATION OF SOME HDBn CODES
 

Nicolae Dumitru ALEXANDRU
"Gh. Asachi" University of Iaºi
Bd.Copou nr.11, RO-6600 Iaºi
nalex@etc.tuiasi.ro

Dimitris VOUKALIS
Technical Educational Institute, Piraeus, Greece
dvouk@tei.gr
 
 

Abstract. This paper deals with the complete spectral characterization of some substitution codes that use blocks of n consecutive zeros which are replaced by substitution sequences selected from a prescribed group. As the substitution sequences are unbalanced (non-zero disparity) the balance is obtained by appropriate alternation of sequences. The substitution codes dealt with are: HDB3 (High-Density Bipolar), AHDB3 and CHDB3 (Compatible High-Density Bipolar).  The method of calculation introduced by G. Petroviæ in 1979 for balanced digital signals was used. It has the advantage of dealing with vectors and matrices of halved size, as compared with other methods. This results in a simplification of calculations and substantially reduces the computing time and the required memory space.
Keywords: Compatible High-Density Bipolar, power spectral density, line coding, spectral shaping.

   Back to top


FORMAL MODEL AND SOFTWARE TOOL FOR WEB SITE DEVELOPING
 

Vladimir MESYURA
Vinnitsa State Technical University,
Khmelnitske shose, 95, Vinnitsa, 21021 Ukraine
vimes@vstu.vinnica.ua

Andrey ZAVARZIN
GIS-Association, Oil and Gaz Institute,
Lenin av., 65, GSP-1, Moskow , 117917, Russian Federation
gisa@inbox.ru
 
 

Abstract. In the article the description summary of the model of informational web site is worked out by the authors. Also in the article the authors give the test example of the site chapter formalization with a help of this model. The model is realized in the PHP language with the use of database mySQL and web-server Apache, and was applied in several Internet projects.
Keywords: dynamic Web-site, informational technologies, Internet, mathematical model
 

  Back to top


APPLICATION OF THE OPTIMAL UNIFORM POLAR QUANTIZATION ON COMPLEX REFLECTIVITY FUNCTION
 

Zoran H. Periæ and Jelena D. Jovkoviæ
Faculty of Electronic Engineering
Beogradska 14, 18000 Nis, Yugoslavia
Peric@elfak.ni.ac.yu  and Jovkov@bankerinter.net
 
 

Abstract. Quantization makes an integral part of the polar data compression process and only real matter is how to satisfy both, accuracy and efficiency. The goal of this research is to develop a new approach for quantization in sense of efficient data compression and improved image quality. Here we introduce method of the optimal uniform polar quantization as an optimal technique in processing polar formatted SAR images and also as a potential concept in ultrasound diagnostics. An elementary way to relate the viewable SAR image to the energy returns from the observing ground is via complex reflectivity function x ??that relates the incident complex phaser electric field of the transmitter with the reflected field. Another field of implementation is in quantization of measured ultrasound parameter called integrated backscatter (IBS) level that is measure of signal energy. Studies over recent years have analyzed only product polar quantization, but in this paper we will introduce method of optimal polar quantization that provides performance improvement of almost 1 dB in a sense of distortion reduction.
Key words: complex reflectivity function, optimal uniform polar quantization.
 

   Back to top


SIMULATION OF SWITCH BOX ROUTING IN FPGA

Marius CERLINCA, Adrian GRAUR, Stefan Gheorghe PENTIUC
„ªtefan cel Mare” University of Suceava, Romania
mariusc@eed.usv.ro, adriang@eed.usv.ro, pentiuc@eed.usv.ro

Abstract. Field-Programmable Gate Arrays (FPGAs) are integrated circuits, which can be programmed to implement virtually any digital circuit. This programmability provides a low-risk, low-turnaround time option for implementing digital circuits. This programmability comes at a cost, however. Typically, circuits implemented on FPGAs are three times slower and have only one tenth the density of circuits implemented using more conventional techniques. Much of this area and speed penalty is due to the programmable routing structures contained in the FPGA. By optimizing these routing structures, significant performance and density improvements are possible. A routing program for simulating how routing is influenced by switch box design was made.
Keywords: integrated circuits, Field-Programmable Gate Arrays, routing, simulation, switch box
 

  Back to top


Advances in Electrical and Computer Engineering
ISSN 1582-7445 - No 1 / 2002
 DISTRIBUTION NETWORK
The issues of the journal are distributed in 22 University Libraries from Belgium, France, Germany, Great Britain, Greece, Ireland, Italy, Moldavia,  Portugal, Romania, Russia, Ukraine, USA and Yugoslavia
Universite des Sciences et Technologies de Lille
Bibliotheque Universitaire Centrale 
Cite Scientifique 
Av. Henri Poincaré BP155 
59653 Villeneuve d’Ascq Cedex 
FRANCE
Universitatea Tehnica a Moldovei
Biblioteca universitara 
Bd. Stefan cel Mare 168 
277012 CHISINAU 
Republica Moldova
Laboratoire d'Informatique Fondamentale de Lille
Bibliotheque 
Batiment M4 
Cite Scientifique 
59655 Villeneuve d’Ascq Cedex 
FRANCE
University of Cernautzi
University Library 
Ul. Kocjubinskogo 2 
274012 CERNOVCY 
UKRAINE
L2EP E.C. Lille
Batiment P2 
Cite Scientifique BP 48 
59655 Villeneuve d’Ascq Cedex
FRANCE 
The State Technical University of Vinnitsa
University Library 
95, Khmelnitska shore 
286021 VINITSA 
UKRAINE 
KAHO Katholieke Hogeschool Sint-Lieven Gent
Gebroeders Desmetstraat 1 
B-9000 GENT 
BELGIUM
Moscow Aviation Institute
Library 
Volo Kolamskoye chosse 4 
125 871 MOSCOW 
RUSSIA 
Universita degli Studii di Catania
Dipartimento Elettrico Elettronico e Sistemistico 
V.le A.Doria, 6 
95125 CATANIA 
ITALY
Moscow Institute of Radioengineering and Electronics
Institute Library 
Pr. Vernadskogo 78 
117 454 MOSCOW V454 
RUSSIA
Instituto Superior de Engenharia do Porto (ISEP)
Biblioteca (Library) 
Rua S. Tome 
4200 PORTO 
PORTUGAL
CITY UNIVERSITY
University Library 
Northampton Square 
LONDON EC1V 0HB 
GREAT BRITAIN
Universite de Franche Comte
Bibliotheque Universitaire 
30, Avenue de l’Observatoire 
25030 BESANCON Cedex Belfort 
FRANCE
University of Colorado
University Library 
COLORADO SPRING 
1420 Austin Bluffs Pkwy 
CO 80907 
USA
Texas Cristian University
University Library 
BOX 32886, FORT WORTH 
76 129 Texas 
USA
National Technical University of Athens
University Library 
ZOGRAPHON 
ATHENS 15773 
GREECE
University of Limerick
Limerick
IRELAND
Institut Arbeit und Technik
Gelsenkirchen
GERMANY
University of Novi Sad
Novi Sad
YUGOSLAVIA
Institute for Cybernetics
Kiev
UKRAINE
Universitatea "Politehnica" Bucuresti
Biblioteca universitara 
BUCURESTI
Biblioteca Centrala Universitara
BUCURESTI
Universitatea Tehnica "Gh. Asachi" Iasi
Biblioteca universitara 
6600 IASI
Universitatea Tehnica Cluj-Napoca
Biblioteca universitara 
26, G.Baritiu 
RO-3400 CLUJ- NAPOCA
Universitatea Tehnica din Timisoara
Biblioteca universitara 
TIMISOARA
Biblioteca Centrala Universitara
IASI
Universitatea din Oradea
Biblioteca universitara 
ORADEA
Universitatea din Galati
Biblioteca universitara 
GALATI
Universitatea din Craiova
Biblioteca universitara
CRAIOVA
Biblioteca Centrala Universitara
CLUJ - NAPOCA

 Back to top


Advances in Electrical and Computer Engineering

ISSN 1582-7445 - No 1 / 2002

Subscription and Paper Submission

Mail
prof. Adrian GRAUR
Faculty of Electrical Engineering
The "Stefan cel Mare" University of Suceava,
str.Universitatii nr.1
RO-5800 SUCEAVA
Romania

e-mail:  adriang@eed.usv.ro

 Back to top