|
Research Institute of Intelligent Computer Systems Ternopil National Economic University |
|
2009, Vol. 8, Issue 2 |
|
Contents and abstracts
A NEW ALGORITHM FOR TIME SERIES DATA MINING Fei Hao 1), Ling Hei Yeung 2)
1) Korea Advanced Institute of Science and Technology This paper is to apply Rough Set to data mining of time series. Firstly, we process the time series data by attribute selection and similarity sequence search. Secondly, the time series is partitioned into some sets of pattern by Mobile Window Method (MWM) and each pattern is a trend of time series. Thirdly, an information table is made by predicting attributes and targeting attribute in trending variation ratio structure sequence (TVRSS). Then, the original information table is made suitably for rough set to discover knowledge. Finally, the extracting rules can predict the time series behavior in the future. The total process is four steps. In the end, we show some examples to demonstrate our method on the time series data of stock market.
AN ITERATIVE METHOD FOR THE EVALUATION
Said E. El-Khamy 1), Mohiy M. Hadhoud 3), Moawad I. Dessouky 2),
1) Department of Electrical Engineering, Faculty of Engineering, Regularized restoration is one of the powerful image restoration techniques because it preserves image details with a high degree of fidelity in the restored image. The main problem encountered in regularized image restoration is the evaluation of the regularization parameter. There are several methods for the evaluation of this parameter which require knowledge of the noise variance in the degraded image. After evaluating this parameter, regularized restoration is implemented by applying a regularization filter on the degraded image. In this paper, we propose a new iterative method for the evaluation of this parameter. This method depends on the maximization of the power in the restored image by the coincidence of the passband of the regularization filter with the frequency band in which, most of the image power exists. The suggested method doesn’t require a priori knowledge of the noise variance. Results show that the estimated value of the regularization parameter leads to a minimum mean square restoration error.
MODELING AND OPTIMIZATION OF PARALLEL INFORMATION Volodymyr Lisovets, Hryhoriy Tsehelyk
Ivan Franko National University of L’viv, In this article the m-parallel method of sequential field searching and two variants of m-parallel block field searching method are offered. These methods are oriented to be used in multiprocessing system for information searching in files of database. We research the effectiveness of these methods for different probability distribution law of field access. The mathematical expectation of number of parallel comparisons necessary for field searching in files is taken as a criterion of effectiveness. The effectiveness of the methods is compared and analyzed. The best of offered methods is founded for every considered probability distribution. Optimal strategies of field searching in sequenced files stored in external memory of multiprocessing system are made. In this case the mathematical expectation of total time needed for field searching in files is taken as a criterion of effectiveness.
TRIANGULAR DISCRETISATION FOR ANALYSIS Y. Lamhene 1), M. Tellache 1), B. Haraoubia 1), H. Baudrand 2)
1) Laboratoire d’Instrumentation, Faculté d’Electronique et d’Informatique In this paper, a study based on iterative method is presented. This method consists in generating a recursive relationship between a wave source and reflected waves from the discontinuity plane which is divided into cells. A high computational speed has been achieved by using Fast Modal Transform (FMT). This work is followed by an application of triangular discretization which offers several advantages over rectangular discretization. The right bend can be simulated by both rectangular and triangular cells, while the mitred bend can be exactly conformed only by the triangular mesh. Deficiencies in the rectangular approximation are identified. The computed results have been successfully compared with published data. HYBRID INFORMATION MODELS IN IMAGE PROCESSING SYSTEMS S. Antoshchuk, Î. Babilunga
Department of the Information Systems, In this article the approach to the development of hybrid information models in image processing systems is presented. This approach allowed creating more effective methods and information technologies of the image processing, analysis and recognition.
A MODIFIED A* ALGORITHM FOR ALLOCATING TASK IN Nirmeen A. Bahnasawy 1), Gamal M. Attiya 2), Mervat Mosa 1), Magdy A. Koutb 2)
1) Dept. of Computer Science and Engineering, Faculty of Engineering, Menoufia University Distributed computing can be used to solve large scale scientific and engineering problems. A parallel application could be divided into a number of tasks and executed concurrently on different computers in the system. This paper provides an optimal task assignment algorithm under memory constraints to minimize required time of finishing a parallel application. The proposed algorithm is based on the optimal assignment sequential search (OASS) of the A* algorithm with additional modifications. This modified algorithm yields optimal solution, lower time complexity, reduces the turnaround time of the application and considerably faster compared with the sequential search algorithm.
A CHOICE OF THE SHORTEST OF THE ALTERNATIVE COMPRESSED Alexander Shport’ko
Department of Informatics and Applied Mathematics In the article the algorithm of generation of the alternative compressed blocks of dynamic Huffman’s codes for every block of data, choice of the shortest compressed block of alternative and iterative diminishing of its size for the improvement of the compression of images in the format of PNG is offered. The methods of the estimation of the size of block of Huffman’s codes according to the absolute frequencies of its elements are examined in details. The fragment of programs outlaying the language of C, which allows exactly to determine the size of the compressed block by principle of generation of dynamic Huffman’s codes and separate working of small frequencies of elements, using for this purpose on the average not more time, than for the close estimation of size with the use of entroping. As experiments show, realization of the offered algorithm, allows to improve the indexes of the compression of the majority of images in the format of PNG in 2 – 6 %.
GPRS-BASED REMOTE SENSING AND CLIMATE CONTROL SYSTEM Wael M. El-Medany
Department of Communications and Electrical Engineering, This paper presents the design and VLSI hardware implementation of a remote sensing system for humidity and temperature in real time. The remote monitoring of the system based on a web design by using GPRS (General Packet Radio Service) network. Since full custom ASIC design takes long time with high cost, programmable logic devices as a programmable ASIC is a better choice for rapid design process and reasonable prices. The design has been described using VHDL (VHSIC Hardware Description Language), and then implemented in hardware using CoolRunner2 CPLD from Xilinx to achieve low cost with rapid prototyping. The design has been simulated and synthesized using Xilinx ISE 6.2i software tools, then test in hardware level using Digilent Spartan 3 starter kit as a hardware tools. The design offers a complete, low cost, powerful and user friendly way of 24 hours real time monitoring system.
PARADIGM SEMANTIC WEB IN THE CONTEXT OF DIGITAL LIBRARY: O. Novytskyi
Institute of Software System NAS of Ukraine This paper presents a several of theoretical ideas and applied technology that can be embodied in the creation of Semantic Digital Library (SDL). In particular, considerable attention paid to how the Semantic Web technology is used in various aspects of DL. A basic level in the DL that may be carriers of semantic description. Described the advantages of this approach. It also highlights issues that arise during the integration of classical electronic libraries and Semantic Web a place in these processes. Made a brief overview of the world’s leading projects to create DL using Semantic Web. IMAGE STRUCTURE ANALYSIS BY 3-STAGES CLUSTERING Roman Melnyk 1), Ruslan Tushnytskyy 2)
1) Software Department, Lviv Polytechnic National University, 12, S. Bandery str., Lviv, 79013, An approach for decomposition of visual images by clustering and breaking them down into geometric figures is considered. Multilevel hierarchical clustering algorithm to form three emphasized levels of clusters such as rectangles, closed regions and integrated areas is proposed. Advantages of such decomposition in three stages are as follows: images covered by rectangles are planned to be formatted and compressed, image fragments could be taken for the preliminary pattern recognition or could easily be corrected, hierarchically constructed fragments are good material to form pattern features for searching procedures. The algorithm complexity, the proposed approach of scanning searching area to reduce it, the rolling up criteria and key parameters for its control are investigated. The results of pattern analysis by structure features for some practical problems are presented in the article.
DETERMINING THE ELEMENTS OF THE TEXT ON IMAGE Elena Pyatikop
Priazov State Technical University This publication describes the modeling results of knowledge of cognitive psychology about the primary processing in the visual system to analyze the images in purpose to determine the elements of the text. Processing images at the level of primary visual cortex formalized using fuzzy sets.
RESEARCHES OF THE COMBINATORIAL MODELS FOR INNOVATIVE Volodymyr Riznyk 1) 2)
1) Lviv Polytechnic National University, 12 S.Bandera Str., 79013, Lviv, Ukraine, rvv@polynet.lviv.ua, The paper presents a new mathematical principle of innovative techniques for improving the quality indices of engineering devices and systems with non-uniform structure (e.g. coding systems) with respect to transmission speed, positioning precision, resolving ability, and functionality, using novel design based on remarkable properties and structural perfection of one- and multidimensional models of the systems, namely the concept of Ideal Ring Bundles (IRB)s prospected from basic laws of the world-wide harmony. Research into the underlying mathematical principle provides an ability to reproduce the maximum number of combinatorial varieties in the systems with a limited number of elements and bonds. This approach make it possible to configure systems with optimal placement of structural elements in spatially or temporally distributed systems, using the appropriate mathematical apparatus of contemporary combinatorial theory.
CALCULATION OF THE TERRITORY RECREATION ATTRACTIVENESS Yaroslav Vyklyuk 1), Olga Artemenko 2)
1) NU “L’vivska Politechnika”, In this paper the calculation method of the territory tourist attractiveness aggregated potential is offered on the base of fuzzy logic taking into account the factor of seasonality. The potentials of tourist attractiveness are found for the basic tourist recreation systems of the Chernivtsi region. SOFTWARE FOR DETERMINATION OF BEHAVIOR PATTERNS OF WEBFORUM MEMBERS Yuriy Syerov, Ruslan Kravets
National University “Lviv Polytechnics”, 12 Bandery Street, Lviv, 79013 Ukraine Article considers actual problem of Web-forums’ members’ behavior and classifying information system development. In the article existing Web-forum CMS’ were analyzed, process of Web-community members’ behavior analyzing was researched and overviewed, the process of information system developing was described.
A METHOD FOR STRUCTURAL SYNTHESIS OF I. Maykiv 1), A. Stepanenko 1), D. Wobschall 2)
1) Research Institute of Intelligent Computer Systems, Ternopil National Economic University, A method for structural synthesis of Network Capable Application Processors (NCAPs) is proposed. It is based on a method of morphological analysis and synthesis and includes phases of functional analysis, structural synthesis, and search for a set of optimal solutions. The proposed method combines lexicographical criterion of preference (L- criterion) at a stage of functional analysis and unconditional criterion of preference (Pareto optimality) during the search phase, which are considered in literature as alternative methods of search for optimal solutions. Combining of criteria, makes it possible to reduce the number of synthesized alternative variants at a stage of structural synthesis and all obtained solutions are allowable. ANALYSIS OF THE 2-SUM PROBLEM AND THE SPECTRAL ALGORITHM Alexander Kolomiychuk
Applied Mathematics Department, Odessa National Polytechnic University, This paper presents the analysis of the 2-sum problem and the spectral algorithm. The spectral algorithm was proposed by Barnard, Pothen and Simon in [1]; its heuristic properties have been advocated by George and Pothen in [4] by formulation of the 2-sum problem as a Quadratic Assignment Problem. In contrast to that analysis another approach is proposed: permutations are considered as vectors of Euclidian space. This approach enables one to prove the bound results originally obtained in [4] in an easier way. The geometry of permutations is considered in order to explain what are ‘good’ and ‘pathological’ situations for the spectral algorithm. Upper bounds for approximate solutions generated by the spectral algorithm are proved. The results of numerical computations on (graphs of) large sparse matrices from real-world applications are presented to support the obtained results and illustrate considerations related to the ‘pathological’ cases.
MAXIMAL USING OF SPECIFICS OF SOME BOUNDARY PROBLEMS IN L.I. Mochurad 1), Y.S. Harasym 2), B.A. Ostudin 3)
1) Post-Graduate Student of the Department of Computational Mathematics, Ivan Franko National University in Lviv, Some typical problems in the numerical analysis of certain types of boundary value problems of the potential theory in substantially spatial formulation are considered. On the basis of the integral equation method (IE) an approximate scheme of solving one model example is built and investigated. It is also considered that the doubly connected open surface where boundary conditions are set obtains the Abelian group of symmetry of the eighth order. This article shows how using the apparatus of the group theory it is possible to solve an initial problem by the help of the sequence of the eight independent IEs, where the integration is realized only on one of the congruent constituents of the surface. It creates the conditions for two parallel processes of problem solution in general. The collocation method for obtaining approximate values of needed “density of charge distribution” in the particular two-dimensional integral equations is used. To take into account the singular way of solving the problem in the circuit of the open surface the a posteriori method of error evaluation is created and the procedure of integrating clarification of solving the task in the mesh node is implemented. To prove the reliability and estimation of the technique efficiency the number of numerical experiments is carried out including the use of so called “plane” approximation of the examined spatial problem. DISTRIBUTED SENSOR NETWORK FOR SECURITY SYSTEMS Pavlo Bykovyy
Research Institute of Intelligent Computer Systems The low-cost network controller for security systems detectors was designed. The controller’s specifics lies in two-wired network interface with the “common bus” topology support. This design reduces the amount of data communication channels from detectors. |