<?xml version="1.0" encoding="UTF-8"?><feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>P107 - ISTA 2007 - Information Systems Technology and its Applications</title>
<link href="http://dl.gi.de/handle/20.500.12116/24198" rel="alternate"/>
<subtitle/>
<id>http://dl.gi.de/handle/20.500.12116/24198</id>
<updated>2026-07-23T19:18:28Z</updated>
<dc:date>2026-07-23T19:18:28Z</dc:date>
<entry>
<title>Towards Entropy-Based Requirements Elicitation</title>
<link href="http://dl.gi.de/handle/20.500.12116/22690" rel="alternate"/>
<author>
<name>Kostanyan, Arkadiy V.</name>
</author>
<author>
<name>Shekhovtsov, Vladimir A.</name>
</author>
<id>http://dl.gi.de/handle/20.500.12116/22690</id>
<updated>2019-08-12T12:57:15Z</updated>
<published>2007-01-01T00:00:00Z</published>
<summary type="text">Towards Entropy-Based Requirements Elicitation
Kostanyan, Arkadiy V.; Shekhovtsov, Vladimir A.
Mayr, Heinrich C.; Karagiannis, Dimitris
This paper presents our views towards constructing the universal parsing technique for the software requirements texts and the requirements elicitation technique based on the output of this parsing process. With the proposed parsing technique, it should be possible to achieve language-independent processing of the requirements texts. Source sentences are treated as systems with words as elements and with a state determining the set of links between elements. The main goal of the parser is to find the state of the system with the highest organization level by minimizing its entropy. The requirements elicitation technique extends trained indicator approach by Cleland-Huang treating inter-word links as indicators. The output of the elicitation process is the set of requirements information ready to be processed further using Conceptual and Aspectual Predesign techniques.
</summary>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Evaluating PSI Ontologies by Mapping to the Common Sense</title>
<link href="http://dl.gi.de/handle/20.500.12116/22689" rel="alternate"/>
<author>
<name>Keberle, Natalya</name>
</author>
<author>
<name>Ermolayev, Vadim</name>
</author>
<author>
<name>Matzke, Wolf-Ekkehard</name>
</author>
<id>http://dl.gi.de/handle/20.500.12116/22689</id>
<updated>2019-08-12T12:57:17Z</updated>
<published>2007-01-01T00:00:00Z</published>
<summary type="text">Evaluating PSI Ontologies by Mapping to the Common Sense
Keberle, Natalya; Ermolayev, Vadim; Matzke, Wolf-Ekkehard
Mayr, Heinrich C.; Karagiannis, Dimitris
The paper presents the results of mapping of PSI Ontologies family to the foundational ontologies: WordNet, SUMO and DOLCE. The two main outcomes of the presented research are: reported manual technique may be used as initial evaluation of ontology claiming to be a golden standard for a new domain; and: usage of mentioned foundational ontologies for alignment of ontologies family of a given domain has shown differences between SUMO and DOLCE, two formal upper-level ontologies of common sense knowledge. The research reported was performed in the frame of our PSI project1.
</summary>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Automated Coding of Qualitative Interviews with Latent Semantic Analysis</title>
<link href="http://dl.gi.de/handle/20.500.12116/22687" rel="alternate"/>
<author>
<name>Feinerer, Ingo</name>
</author>
<author>
<name>Wild, Fridolin</name>
</author>
<id>http://dl.gi.de/handle/20.500.12116/22687</id>
<updated>2019-08-12T12:57:17Z</updated>
<published>2007-01-01T00:00:00Z</published>
<summary type="text">Automated Coding of Qualitative Interviews with Latent Semantic Analysis
Feinerer, Ingo; Wild, Fridolin
Mayr, Heinrich C.; Karagiannis, Dimitris
Coding and analysing qualitative interviews is one of several core techniques used in marketing research. Qualitative methods offer valuable information hardly gained by standard quantitative methods since open-ended questions and interviews provide deeper insight into customer demands. The main disadvantages of qualitative methods are their inherent subjectivity and their high costs. We tackle this problem by applying latent semantic analysis (LSA) in a fully automated way on transcripts of interviews and we propose two algorithms based on LSA. We evaluate the algorithms against two separate real-life cases taken from the automobile industry and from the Austrian mobile phone market. Thereby, we compare the machine results against marketing expert judgements and show that the algorithms proposed provide perfect reliability with appropriate validity in automated coding and textual analysis.
</summary>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Analytical data modeling of investment project financing process</title>
<link href="http://dl.gi.de/handle/20.500.12116/22688" rel="alternate"/>
<author>
<name>Godlevskiy, Mikhail D.</name>
</author>
<author>
<name>Moskalenko, Valentina V.</name>
</author>
<author>
<name>Kondrashchenko, Vladimir V.</name>
</author>
<id>http://dl.gi.de/handle/20.500.12116/22688</id>
<updated>2019-08-12T12:57:15Z</updated>
<published>2007-01-01T00:00:00Z</published>
<summary type="text">Analytical data modeling of investment project financing process
Godlevskiy, Mikhail D.; Moskalenko, Valentina V.; Kondrashchenko, Vladimir V.
Mayr, Heinrich C.; Karagiannis, Dimitris
The present work is devoted to the research of investment projects’ financing issues. Within this paper a data analytical tool for an optimal financing schema computation on the basis of solving the multicriterion dynamical problem is being presented. The model reflects the interests of both company and investor receiving maximum profit from the project execution as well as selection of a priority source of financing on the basis of capital cost minimization principle. We have developed the software on Java in order to perform an automated computation of an optimal financing schema using the suggested algorithm. The developed software is a complete solution for working with project data, obtaining the results (in the text and chart views) and generating reports.
</summary>
<dc:date>2007-01-01T00:00:00Z</dc:date>
</entry>
</feed>
