Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "MULTI" wg kryterium: Temat


Tytuł:
A belief revision approach for argumentation-based negotiation agents
Autorzy:
Pilotti, P.
Casali, A.
Chesñevar, C.
Powiązania:
https://bibliotekanauki.pl/articles/330448.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
argumentation based negotiation
collaborative agents
belief revision
multi-agent system
Opis:
Negotiation is an interaction that happens in multi-agent systems when agents have conflicting objectives and must look for an acceptable agreement. A typical negotiating situation involves two agents that cannot reach their goals by themselves because they do not have some resources they need or they do not know how to use them to reach their goals. Therefore, they must start a negotiation dialogue, taking also into account that they might have incomplete or wrong beliefs about the other agent’s goals and resources. This article presents a negotiating agent model based on argumentation, which is used by the agents to reason on how to exchange resources and knowledge in order to achieve their goals. Agents that negotiate have incomplete beliefs about the others, so that the exchange of arguments gives them information that makes it possible to update their beliefs. In order to formalize their proposals in a negotiation setting, the agents must be able to generate, select and evaluate arguments associated with such offers, updating their mental state accordingly. In our approach, we will focus on an argumentation-based negotiation model between two cooperative agents. The arguments generation and interpretation process is based on belief change operations (expansions, contractions and revisions), and the selection process is a based on a strategy. This approach is presented through a high-level algorithm implemented in logic programming. We show various theoretical properties associated with this approach, which have been formalized and proved using Coq, a formal proof management system. We also illustrate, through a case study, the applicability of our approach in order to solve a slightly modified version of the well-known home improvement agents problem. Moreover, we present various simulations that allow assessing the impact of belief revision on the negotiation process.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 3; 455-470
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Verified methods for computing Pareto sets: General algorithmic analysis
Autorzy:
G.-Tóth, B.
Kreinovich, V.
Powiązania:
https://bibliotekanauki.pl/articles/930124.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optymalizacja wielocelowa
zbiór Pareto
multi-objective optimisation
Pareto set
verified computing
Opis:
In many engineering problems, we face multi-objective optimization, with several objective functions f1, . . . , fn. We want to provide the user with the Pareto set-a set of all possible solutions x which cannot be improved in all categories (i.e., for which fj (x') fj (x) for all j and fj(x') > fj(x) for some j is impossible). The user should be able to select an appropriate trade-off between, say, cost and durability. We extend the general results about (verified) algorithmic computability of maxima locations to show that Pareto sets can also be computed.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 3; 369-380
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Control of a Team of Mobile Robots Based on Non-cooperative Equilibria with Partial Coordination
Autorzy:
Skrzypczyk, K.
Powiązania:
https://bibliotekanauki.pl/articles/908483.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system wielorobotowy
planowanie ruchu
teoria gier
multi-robot systems
motion planning
game theory
Opis:
In this work we present an application of the concept of non-cooperative game equilibria to the design of a collision free movement of a team of mobile robots in a dynamic environment. We propose the solution to the problem of feasible control synthesis, based on a partially centralized sensory system. The control strategy based on the concept of non-cooperative game equilibria is well known in the literature. It is highly efficient through phases where the solution is unique. However, even in simple navigation problems, it happens that multiple equilibria occur, which incurs a problem for control synthesis and may lead to erroneous results. In this paper we present a solution to this problem based on the partial centralization idea. The coordinator module is incorporated into the system and becomes active when multiple equilibria are detected. The coordination method includes a ``fair arbiter'' for the selection of an appropriate equilibrium solution. Simulation studies of the proposed methodology were carried out for 2, 3 and 5 robots, and their results are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 1; 89-97
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A multi-agent brokerage platform for media content recommendation
Autorzy:
Veloso, B.
Malheiro, B.
Burguillo, J. C.
Powiązania:
https://bibliotekanauki.pl/articles/330094.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
multi agent computing
brokerage platform
media content personalisation
recommendation
przetwarzanie wieloagentowe
platforma maklerska
Opis:
Near real time media content personalisation is nowadays a major challenge involving media content sources, distributors and viewers. This paper describes an approach to seamless recommendation, negotiation and transaction of personalised media content. It adopts an integrated view of the problem by proposing, on the business-to-business (B2B) side, a brokerage platform to negotiate the media items on behalf of the media content distributors and sources, providing viewers, on the business-to-consumer (B2C) side, with a personalised electronic programme guide (EPG) containing the set of recommended items after negotiation. In this setup, when a viewer connects, the distributor looks up and invites sources to negotiate the contents of the viewer personal EPG. The proposed multi-agent brokerage platform is structured in four layers, modelling the registration, service agreement, partner lookup, invitation as well as item recommendation, negotiation and transaction stages of the B2B processes. The recommendation service is a rule-based switch hybrid filter, including six collaborative and two content-based filters. The rule-based system selects, at runtime, the filter(s) to apply as well as the final set of recommendations to present. The filter selection is based on the data available, ranging from the history of items watched to the ratings and/or tags assigned to the items by the viewer. Additionally, this module implements (i) a novel item stereotype to represent newly arrived items, (ii) a standard user stereotype for new users, (iii) a novel passive user tag cloud stereotype for socially passive users, and (iv) a new content-based filter named the collinearity and proximity similarity (CPS). At the end of the paper, we present off-line results and a case study describing how the recommendation service works. The proposed system provides, to our knowledge, an excellent holistic solution to the problem of recommending multimedia contents.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 3; 513-527
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stability of Multi-Dimensional Discrete Systems With Varying Structure
Autorzy:
Dymkov, M.
Gaishun, I.
Powiązania:
https://bibliotekanauki.pl/articles/908265.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
układ wielowymiarowy
złożenie krzywoliniowe
stabilność
multi-dimensional systems
total solvability
curvilinear composition
stability
Opis:
A new class of multi-dimensional discrete systems with varying structureis introduced. The notions of total solvability, p_t-boundedness, p_t-stability and asymptotic stability are defined. For studying properties of the solutions for the considered systems a curvilinear composition of mappings along discrete curves is used. Total solvability conditions similar to the Frobenius ones are obtained. Sufficient conditions for p_t-stability and asymptotic stability based on the Lyapunov functional method are also established. A two-dimensional system of Volterra equations is presented as an example of equations with varying structure.
Źródło:
International Journal of Applied Mathematics and Computer Science; 1999, 9, 4; 789-799
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An optimal path planning problem for heterogeneous multi-vehicle systems
Autorzy:
Klaučo, M.
Blažek, S.
Kvasnica, M.
Powiązania:
https://bibliotekanauki.pl/articles/330754.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
path planning
multi vehicle system
mixed-integer programming
planowanie ruchu
system wielopojazdowy
programowanie całkowitoliczbowe
Opis:
A path planning problem for a heterogeneous vehicle is considered. Such a vehicle consists of two parts which have the ability to move individually, but one of them has a shorter range and is therefore required to keep in a close distance to the main vehicle. The objective is to devise an optimal path of minimal length under the condition that at least one part of the heterogeneous system visits all desired waypoints exactly once. Two versions of the problem are considered. One assumes that the order in which the waypoints are visited is known a priori. In such a case we show that the optimal path can be found by solving a mixed-integer second-order cone problem. The second version assumes that the order in which the waypoints are visited is not known a priori, but can be optimized so as to shorten the length of the path. Two approaches to solve this problem are presented and evaluated with respect to computational complexity.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 297-308
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Method for Determining the Properties of Multi-Screen Interfaces
Autorzy:
Ngo, D.C.L.
Teo, L. S.
Byrne, J.G.
Powiązania:
https://bibliotekanauki.pl/articles/911164.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
interfejs
interfejs wieloprzesiewowy
screen design
interface aesthetics
aesthetic measures
aesthetic characteristics
multi-screen interfaces
Opis:
An important aspect of screen design is aesthetic evaluation of screen layouts. While it is conceivable to define a set of variables that characterize the key attributes of many alphanumeric display formats, such a task seems difficult for graphic displays because of their much greater complexity. This article proposes a theoretical approach to capture the essence of artists' insights with seven aesthetic measures for graphic displays. The formalized measures include symmetry, sequence, cohesion, regularity, homogeneity, rhythm, and order and complexity. The paper concludes with some thoughts on the direction which future research should take.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 2; 413-426
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Another Look at a Model for Evaluating Interface Aesthetics
Autorzy:
Ngo, D.C.L.
Byrne, J.G.
Powiązania:
https://bibliotekanauki.pl/articles/908342.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
technika informacyjna
informatyka
screen design
interface aesthetics
aesthetic measures
aesthetic characteristics
multi-screen interfaces
Opis:
Gestalt psychologists promulgated the principles of visual organisation in the early twentieth century. These principles have been discussed and re-emphasised, and their importance and relevance to user interface design is understood. However, a limited number of systems represent and make adequate use of this knowledge in the form of a design tool that supports certain aspects of the user interface design process. The graphic design rules that these systems use are extremely rudimentary and often vastly oversimplified. Most of them have no concept of design basics such as visual balance or rhythm. In this paper, we attempt to synthesize the guidelines and empirical data related to the formatting of screen layouts into a well-defined model. Fourteen aesthetic characteristics have been selected for that purpose. The results of our exercise suggest that these characteristics are important to prospective viewers.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 2; 515-535
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
FSP and FLTL framework for specification and verification of middle-agents
Autorzy:
Bădică, A.
Bădică, C.
Powiązania:
https://bibliotekanauki.pl/articles/907813.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system wieloagentowy
algebra procesów
specyfikacja formalna
multi-agent system
interaction protocol
process algebra
formal specification
Opis:
Agents are a useful abstraction frequently employed as a basic building block in modeling service, information and resource sharing in global environments. The connecting of requester with provider agents requires the use of specialized agents known as middle-agents. In this paper, we propose a formal framework intended to precisely characterize types of middle-agents with a special focus on matchmakers, brokers and front-agents by formally modeling their interactions with requesters and providers. Our approach is based on capturing interaction protocols between requesters, providers and middle-agents as finite state processes represented using FSP process algebra. The resulting specifications are formally verifiable using FLTL temporal logic. The main results of this work include (i) precise specification of interaction protocols depending on the type of middle-agent (this can also be a basis for characterizing types of middle-agents), (ii) improvement of communication between designers and developers and facilitation of formal verification of agent systems, (iii) guided design and implementation of agent-based software systems that incorporate middle-agents.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 1; 9-25
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithms and fuzzy sets for discovering temporal rules
Autorzy:
Matthews, S. G.
Gongora, M. A.
Hopgood, A. A.
Powiązania:
https://bibliotekanauki.pl/articles/330148.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
fuzzy association rules
temporal association rules
multi objective evolutionary algorithm
reguła asocjacji rozmytej
wieloobiektowy algorytm ewolucyjny
Opis:
A novel method is presented for mining fuzzy association rules that have a temporal pattern. Our proposed method contributes towards discovering temporal patterns that could otherwise be lost from defining the membership functions before the mining process. The novelty of this research lies in exploring the composition of fuzzy and temporal association rules, and using a multi-objective evolutionary algorithm combined with iterative rule learning to mine many rules. Temporal patterns are augmented into a dataset to analyse the method’s ability in a controlled experiment. It is shown that the method is capable of discovering temporal patterns, and the effect of Boolean itemset support on the efficacy of discovering temporal fuzzy association rules is presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 4; 855-868
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Inferring graph grammars by detecting overlap in frequent subgraphs
Autorzy:
Kukluk, J. P.
Holder, L. B.
Cook, D. J.
Powiązania:
https://bibliotekanauki.pl/articles/907941.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
indukcja gramatyczna
gramatyka grafowa
pozyskiwanie danych
grammar induction
graph grammars
graph mining
multi-relational data mining
Opis:
In this paper we study the inference of node and edge replacement graph grammars. We search for frequent subgraphs and then check for an overlap among the instances of the subgraphs in the input graph. If the subgraphs overlap by one node, we propose a node replacement graph grammar production. If the subgraphs overlap by two nodes or two nodes and an edge, we propose an edge replacement graph grammar production. We can also infer a hierarchy of productions by compressing portions of a graph described by a production and then inferring new productions on the compressed graph. We validate the approach in experiments where we generate graphs from known grammars and measure how well the approach infers the original grammar from the generated graph. We show graph grammars found in biological molecules, biological networks, and analyze learning curves of the algorithm.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 2; 241-250
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Uncertainty Models of Vision Sensors in Mobile Robot Positioning
Autorzy:
Skrzypczyński, P.
Powiązania:
https://bibliotekanauki.pl/articles/908490.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
robot mobilny
sensor wizyjny
system wieloagentowy
mobile robots
vision sensors
positioning
uncertainty
action planning
multi-agent systems
Opis:
This paper discusses how uncertainty models of vision-based positioning sensors can be used to support the planning and optimization of positioning actions for mobile robots. Two sensor types are considered: a global vision with overhead cameras, and an on-board camera observing artificial landmarks. The developed sensor models are applied to optimize robot positioning actions in a distributed system of mobile robots and monitoring sensors, and to plan the sequence of actions for a robot cooperating with the external infrastructure supporting its navigation.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 1; 73-88
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A rainfall forecasting method using machine learning models and its application to the Fukuoka city case
Autorzy:
Sumi, S. M.
Zaman, M. F.
Hirose, H.
Powiązania:
https://bibliotekanauki.pl/articles/331290.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
maszyna ucząca się
metoda wielomodelowa
przetwarzanie wstępne
rainfall forecasting
machine learning
multi model method
preprocessing
model ranking
Opis:
In the present article, an attempt is made to derive optimal data-driven machine learning methods for forecasting an average daily and monthly rainfall of the Fukuoka city in Japan. This comparative study is conducted concentrating on three aspects: modelling inputs, modelling methods and pre-processing techniques. A comparison between linear correlation analysis and average mutual information is made to find an optimal input technique. For the modelling of the rainfall, a novel hybrid multi-model method is proposed and compared with its constituent models. The models include the artificial neural network, multivariate adaptive regression splines, the k-nearest neighbour, and radial basis support vector regression. Each of these methods is applied to model the daily and monthly rainfall, coupled with a pre-processing technique including moving average and principal component analysis. In the first stage of the hybrid method, sub-models from each of the above methods are constructed with different parameter settings. In the second stage, the sub-models are ranked with a variable selection technique and the higher ranked models are selected based on the leave-one-out cross-validation error. The forecasting of the hybrid model is performed by the weighted combination of the finally selected models.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 841-854
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using information on class interrelations to improve classification of multiclass imbalanced data: A new resampling algorithm
Autorzy:
Janicka, Małgorzata
Lango, Mateusz
Stefanowski, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/330287.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
imbalanced data
multi-class learning
re-sampling
data difficulty factor
similarity degree
dane niezrównoważone
ponowne próbkowanie
stopień podobieństwa
Opis:
The relations between multiple imbalanced classes can be handled with a specialized approach which evaluates types of examples’ difficulty based on an analysis of the class distribution in the examples’ neighborhood, additionally exploiting information about the similarity of neighboring classes. In this paper, we demonstrate that such an approach can be implemented as a data preprocessing technique and that it can improve the performance of various classifiers on multiclass imbalanced datasets. It has led us to the introduction of a new resampling algorithm, called Similarity Oversampling and Undersampling Preprocessing (SOUP), which resamples examples according to their difficulty. Its experimental evaluation on real and artificial datasets has shown that it is competitive with the most popular decomposition ensembles and better than specialized preprocessing techniques for multi-imbalanced problems.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 4; 769-781
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem
Autorzy:
Czarnowski, I.
Jędrzejowicz, P.
Powiązania:
https://bibliotekanauki.pl/articles/907819.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
redukcja danych
komputerowe uczenie się
optymalizacja
system wieloagentowy
data reduction
machine learning
A-Team
optimization
multi-agent system
Opis:
The problem considered concerns data reduction for machine learning. Data reduction aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction results in increased capabilities and generalization properties of the learning model and a shorter time of the learning process. It can also help in scaling up to large data sources. The paper proposes an agent-based data reduction approach with the learning process executed by a team of agents (A-Team). Several A-Team architectures with agents executing the simulated annealing and tabu search procedures are proposed and investigated. The paper includes a detailed description of the proposed approach and discusses the results of a validating experiment.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 1; 57-68
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies