Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 410.00Impact Factor 2024: 0.4
Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:
- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.
Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.
Article Type: Other
DOI: 10.3233/FI-2009-184
Citation: Fundamenta Informaticae, vol. 96, no. 4, pp. i-ii, 2009
Authors: Rhee, Sang Keun | Lee, Jihye | Park, Myon-Woong | Szymczak, Michał | Fr�ckowiak, Grzegorz | Ganzha, Maria | Paprzycki, Marcin
Article Type: Research Article
Abstract: In our work, an agent-based system supporting workers in an organization is centered around utilization of ontologically demarcated data. In this system, ontological matchmaking, understood as a way of establishing closeness between resources, is one of key functionalities. Specifi- cally, it is used to autonomously provide recommendations to the user, who is represented by her/his personal agent. These recommendations specify, which among available resources are relevant/of interest to the worker. In this paper, we discuss …our approach to measuring semantic closeness between ontologically demarcated information objects, while a Duty Trip Support application is used as a case study. General description of the algorithm is followed by a recommendation example based on support for a worker who is seeking advice in planning a duty trip. Show more
Keywords: Ontological matchmaking, semantic closeness, recommender system, resource management, resource matching
DOI: 10.3233/FI-2009-185
Citation: Fundamenta Informaticae, vol. 96, no. 4, pp. 395-418, 2009
Authors: El Jelali, Soufiane | Lyhyaoui, Abdelouahid | Figueiras-Vidal, Aníbal R.
Article Type: Research Article
Abstract: When training machine classifiers, to replace hard classification targets by emphasized soft versions of them helps to reduce the negative effects of using standard cost functions as approximations to misclassification rates. This emphasis has the same kind of effect as sample editing methods, that have proved to be effective for improving classifiers performance. In this paper, we explore the effectiveness of using emphasized soft targets with generative models, such as Gaussian MixtureModels (GMM), and Gaussian Processes …(GP). The interest of using GMMis that they offer advantages such as an easy interpretation and straightforward possibilities to deal with missing values. With respect to GP, if we use soft targets, we do not need to resort to any complex approximation to get a Gaussian Process classifier and, simultaneously, we can obtain the advantages provided by the use of an emphasis. Simulation results support the usefulness of the proposed approach to get better performance and show a low sensitivity to design parameters selection. Show more
Keywords: Smoothing target, sample selection, classification, GMM, GP
DOI: 10.3233/FI-2009-186
Citation: Fundamenta Informaticae, vol. 96, no. 4, pp. 419-433, 2009
Authors: Paradowski, Mariusz | Kwasnicka, Halina
Article Type: Research Article
Abstract: Automatic Image Annotation is an important research topic in pattern recognition area. There are many different approaches to Automatic Image Annotation. In many of these approaches a key problem is determining correct word distributions in the generated annotations. Incorrect word distributions (word frequencies) results in large reduction of annotation quality. The paper presents a generic approach to find correct word frequencies. The approach may be used with many automatic image annotators, based on various machine learning …paradigms. Proposed method is an improved version of our already presented method, called Greedy Resulted Word Counts Optimization. The key differences and novelties in the paper are: the concept of border support values and a method of optimal step selection in the optimization routine. Optimal step selection allows to reduce the number of computations during the optimization procedure, comparing to old Greedy Resulted Word Counts Optimization method. Show more
Keywords: Automatic Image Annotation, Word Counts Optimization
DOI: 10.3233/FI-2009-187
Citation: Fundamenta Informaticae, vol. 96, no. 4, pp. 435-463, 2009
Authors: Brzostowski, Krzysztof | Świa�tek, Jerzy
Article Type: Research Article
Abstract: In the paper five different models have been examined in order to test their ability to describe relationship between EMG and force moment generated by moving upper or lower limb. In system analysis point of view it can be utilised for diagnostic purpose i.e. conversing subjective methods using by physician to new one based on objective measured data.
Keywords: EMG-to-activation model, neural networks, neuro-fuzzy models, ARMAX, human elbow, spasticity
DOI: 10.3233/FI-2009-188
Citation: Fundamenta Informaticae, vol. 96, no. 4, pp. 465-475, 2009
Authors: Kotowski, Stefan | Kosiński, Witold | Michalewicz, Zbigniew | Synak, Piotr | Brocki, Łukasz
Article Type: Research Article
Abstract: Convergence of genetic algorithms in the form of asymptotic stability requirements is discussed. Some tools to measure convergence properties of genetic algorithms are introduced. A classification procedure is proposed that is based on the following conjecture: the entropy and the fractal dimension of trajectories of genetic algorithms produced by them are quantities that can characterize the algorithms. The role of these quantities as invariants of the algorithm classes is discussed together with the compression …ratio of points of genetic algorithms. Show more
Keywords: Genetic Algorithm, Classification, Convergence
DOI: 10.3233/FI-2009-189
Citation: Fundamenta Informaticae, vol. 96, no. 4, pp. 477-491, 2009
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]