The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The paper presents the method of a group decision making in a competitive environment. We deal with a group decision when the group of people with different preferences are to make one single decision. The group decision selection process is modeled with the use of multi-criteria optimization task. It is solved with the use of reference point method. This method is an interactive method in which every...
A growing number of users, seeking to influence their friends, are adopting social network sites, like Facebook to increase their social presence. In the relatively few scholarly studies that consider how writing comments on social network sites influences their friends, the focus has been on marketing or promotion. Little is known about the impact of user writing versus reading on social media. In...
A problem of identification of faulty processors of a multiprocessor system is investigated. A method to reduce a pattern of a global syndrome for multiprocessor system which has a 4-cube topology, for the MM model, is presented. Results of the method for some topologies are also presented.
This paper presents the issue of fuzzy arithmetic calculations in two different notations. The well-known L-R notation proposed by Dubois-Prade, which enjoys a well-earned recognition of the researchers dealing with fuzzy logic was presented on one hand. On the other hand, a OFN notation introduced by Kosiński was discussed. Comparative calculations were performed using the data of the benchmark “Dam...
The paper contributes to the problem solving in semantic browsing and analysis of scientific articles. With reference to presented visual interface, four - the most popular methods of mapping including own approach - MDS with spherical topology, have been compared. For a comparison quantitative measures were applied which allowed to select the most appropriate mapping way with an accurate reflection...
We investigate whether language models used in automatic speech recognition (ASR) should be trained on speech transcripts rather than on written texts. By calculating log-likelihood statistic for part-of-speech (POS) n-grams, we show that there are significant differences between written texts and speech transcripts. We also test the performance of language models trained on speech transcripts and...
Reengineering of an existing information system can be carried out: to improve its maintainability, to migrate to a new technology, to improve quality or to prepare for functional enhancement. An important phase of a data-oriented software system reengineering is a database reengineering process and, in particular, its subprocess - a database reverse engineering process. The reverse engineering process...
This paper describes the automatic summarization system developed for the Polish language. The system implements sentence-based extractive summarization technique, which consists in determining most important sentences in document due to their computed salience. A structure of the system is presented, as well as the evaluation method and achieved results. The presented attempt is intended to serve...
The paper is devoted to discussion of the minimal cycles of the so called Kaprekar's transformations and some of its generalizations. The considered transformations are the self-maps of the sets of natural numbers possessing n digits in their decimal expansions. In the paper there are introduced several new characteristics of such maps, among others, the ones connected with the Sharkovsky's theorem...
Let equation We conjecture that if a system T ⊆ {xi + 1 = xk, xi · xj = xk : i, j, k ∈ {1, … , n}} has only finitely many solutions in positive integers x1, … , xn, then each such solution (x1, … , xn) satisfies x1, … , xn ≤ f (n). We prove that the function f cannot be decreased and the conjecture implies that there is an algorithm which takes as input a Diophantine equation, returns an integer,...
The generalized Wiener polarity index W{ink}(G) of a graph G = (V, E) is defined as a number of unordered pairs {u, v} of G such that the shortest distance between u and v is equal to k: Wk(G) = |{{u, v}, d(u, v) = k, u, v ∈ V (G)}| In this paper we give some results for 2-trees in case of mentioned index. We present an infinite family of 2-trees with maximum value of generalized Wiener polarity index.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.