Ministry points: Help
|2020||5||Not listed on the ministry scored journals list|
|2019||5||Not listed on the ministry scored journals list|
- author's version of the article before the review
- author's version of the article after the review
Status table SHERPA RoMEO
|RoMEO color||Archiving policy|
|Green||can archive pre-prints and post-prints or a version of the publisher|
|Blue||can archive post-prints|
|Yellow||can archive pre-prints|
|White||can not archive any materials|
Papers published in journal
Set S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | . That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it . Property testers are algorithms that distinguish inputs...
Monitoring of dynamic multi-agent systems, here agents are allowed to appear and disappear, and can migrate between network nodes is a complex tasks. Applying the traditional monitoring methods is not effective, as little can be assumed in advance about such environments. It is necessary to track changes in addressing and availability of agents to create and maintain mapping between agents and their network addresses. The...
An Attempt to Develop a Model Selection Algorithm of Computer Simulation during the Design Process of Mechanical Response of Any Mechanical BodyPublication
In the literature, there are algorithms associated with the design of simulations of technological processes, in which the material model has always been defined previously. However, in none of the studies of computer simulation modelling of technological processes known to the authors of this article, is there a detailed description of how the algorithm, or the selection of plastic model used, is subject to this process. This...
Multi-agent systems consist of many autonomous units, called agents, that can interact when trying to achieve their goals. The selection of interaction partners is called team formation. Three basic approaches can be considered to match multi-agent system resources to the problem at hand. To research the properties of different approaches, a software for modeling team formation in multi-agent systems has been created and is presented...
Taking decision in multi-agent systems may involve voting. Two basic voting protocols are surveyed in the paper. Then, a new history-based dynamic weight voting is proposed. This voting protocol allows for identification of the agents which contribute to the correct system decision. The proposed solution is contrasted with majority voting and with weighted average voting, to show its advantages
The issue of integrating applications which are only accessible through visual user interface is not thoroughly researched. Integration of web applications running remotely and controlled by separate organizations becomes even more complicated, as their user interface can display differently in different browsers or change without prior notification as a result of application maintenance. While possible, it is generally not common...
Data stored in average computer system usually is not unique, portions of stored data are duplicated. When duplicated data are stored in separate files containing source code of computer program of student homework, a possibility of cheating should be seriously considered. This paper presents software tools built, in order to detect re-use of pieces of code in supplied text files. Three aspects of information atching are considered:...
In this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
The paper presents application called FIReWORK, that allows for automatic creation of the VHDL hardware structures of FIR filters. Automat- ically generated specialized hardware solutions dedicated to the FPGA and ASIC are commonly known as Intellectual Property Cores. The essential fu- ture of the application is easy initialization of FIR filter parameters in GUI, and then automatically design, calculate and generate the IP Core...
In the paper we discuss the notion of Shannon capacity for invariant and evolving channels. We show how this notion is involved in information theory, graph theory and Ramsey theory.
This paper presents the time and cost efficient method for measuring effective coverage of IEEE 802.16-2004 standard-based networks. This is done by performing a series of continuous measurements on the grid basis. Due to this kind of signal quality surveying, estimationof the probable coverage area can be made. It is significant that themethod is fast and is uses a standard customer equipment which makes it more accessible for...
W poprzednich pracach wprowadzono metodę reprezentacji wiedzy, zwaną Kartografią Wiedzy. Metoda ta pozwala na zapisanie, w formie tzw. map konceptów, zależności pomiędzy konceptami wyróżnionymi w terminologii, a następnie stopniowe (wraz ze wzrostem naszej wiedzy) przypisywanie indywidualnym obiektom tych konceptów. Efektywność budowy map konceptów jest kluczowym czynnikiem wpływającym na możliwość użycia metody. Niniejsza praca...
Artykuł dotyka problematyki wzajemnych interferencji sieci Bluetooth i IEEE 802.11b. W szczególności analizowano wpływ transmisji 802.11b na pracę pojedynczej pikosieci w danym scatternecie BT.
seen 72 times