Computer Science
Loading...
ISSN 1508-2806
e-ISSN: 2300-7036
Call number
Volume
Vol. 7
Date
2005
Description
Journal
Computer Science
AGH University Press (2004-)
ISSN: 1508-2806 e-ISSN: 2300-7036
ISSN: 1508-2806 e-ISSN: 2300-7036
journal.volume.project
Contains
Journal Issues
Articles
Symboliczna dekompozycja blokowa w generatorze siatek sześciościennych
(2005) Adamek, Andrzej; Głut, Barbara
Hexahedral mesh generation for three-dimensional solid objects is often done in stages. Usually an object is first subdivided into simple-shaped subregions, which then are filled with hexahedral finite elements. This article presents an automatic subdividing method of polyhedron with planar faces. The subdivision is based on medial surface, axes and nodes of a solid. The main emphasis is put on creating a topology of subregions. Obtaining such a topology involves defining a graph structure OMG which contains necessary information about medial surface topology and object topology, followed by simple symbolic processing on it.
Text summarizing in Polish
(2005) Branny, Emilia; Gajęcki, Marek
The aim of this article is to describe an existing implementation of a text summarizer for Polish, to analyze the results and propose the possibilities of further development. The problem of text summarizing has been already addressed by science but until now there has been no implementation designed for Polish. The implemented algorithm is based on existing developments in the field but it also includes some improvements. It has been optimized for newspaper texts ranging from approx. 10 to 50 sentences. Evaluation has shown that it works better than known generic summarization tools when applied to Polish.
Support for distributed programming in extreme style
(2005) Dajda, Jacek; Ciszewski, Stanisław
The basic limitation emerging from practising eXtreme Programming methodology is the constraint of close physical proximity between the members of the collaborating team including customer. This became the main idea behind research on XP supporting environment for geographically distributed teams. This work presents basic assumptions, elaborated architecture and selected implementation issues for the system of this type. Deliberations are supplied with the initial results of the verification of its usability based on the users tests.
Interoperability of monitoring-related tools
(2005) Funika, Włodzimierz; Janik, Arkadiusz
Networking, distributed and grid computing have become the commonly used paradigms of programming. Due to the complicated nature of distributed and grid systems and the increasing complexity of the applications designed for these architectures, the development process needs to be supported by different kinds of tools at every stage of a development process. In order to avoid improper influences of one tool to another these tools must cooperate. The cooperation ability is called interoperability. Tools can interoperate on different levels, from exchanging the data in common format, to a semantical level by executing some action as a result of an event in another tool. In this paper we present some interoperability models, with focus on their advantages and major problems due to their use. We also present an interoperability model designed and used in the JINEXT extension to OMIS specification, intended to provide interoperability for OMIS-compliant tools.
Enhancements of Fuzzy Q-Learning algorithm
(2005) Głowaty, Grzegorz
Fuzzy Q-Learning algorithm combines reinforcement learning techniques with fuzzy modelling. It provides a flexible solution for automatic discovery of rules for fuzzy systems in the process of reinforcement learning. In this paper we propose several enhancements to the original algorithm to make it more performant and more suitable for problems with continuous-input continuous-output space. Presented improvements involve generalization of the set of possible rule conclusions. The aim is not only to automatically discover an appropriate rule-conclusions assignment, but also to automatically define the actual conclusions set given the all possible rules conclusions. To improve algorithm performance when dealing with environments with inertness, a special rule selection policy is proposed.