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ę "Cellular" wg kryterium: Temat


Wyświetlanie 1-7 z 7
Tytuł:
Existence and exponential stability of a periodic solution for fuzzy cellular neural networks with time-varying delays
Autorzy:
Zhang, Q.
Yang, L.
Liao, D.
Powiązania:
https://bibliotekanauki.pl/articles/930186.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć neuronowa
stateczność wykładnicza
rozwiązanie okresowe
fuzzy cellular neural networks
global exponential stability
periodic solution
coincidence degree
Opis:
Fuzzy cellular neural networks with time-varying delays are considered. Some sufficient conditions for the existence and exponential stability of periodic solutions are obtained by using the continuation theorem based on the coincidence degree and the differential inequality technique. The sufficient conditions are easy to use in pattern recognition and automatic control. Finally, an example is given to show the feasibility and effectiveness of our methods.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 4; 649-658
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decentralized job scheduling in the cloud based on a spatially generalized Prisoner’s Dilemma game
Autorzy:
Gąsior, J.
Seredyński, F.
Powiązania:
https://bibliotekanauki.pl/articles/329736.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
job scheduling
multiobjective optimization
genetic algorithm
prisoner's dilemma
cellular automata
harmonogramowanie zadań
optymalizacja wielokryterialna
algorytm genetyczny
dylemat więźnia
automat komórkowy
Opis:
We present in this paper a novel distributed solution to a security-aware job scheduling problem in cloud computing infrastructures. We assume that the assignment of the available resources is governed exclusively by the specialized brokers assigned to individual users submitting their jobs to the system. The goal of this scheme is allocating a limited quantity of resources to a specific number of jobs minimizing their execution failure probability and total completion time. Our approach is based on the Pareto dominance relationship and implemented at an individual user level. To select the best scheduling strategies from the resulting Pareto frontiers and construct a global scheduling solution, we developed a decision-making mechanism based on the game-theoretic model of Spatial Prisoner’s Dilemma, realized by selfish agents operating in the two-dimensional cellular automata space. Their behavior is conditioned by the objectives of the various entities involved in the scheduling process and driven towards a Nash equilibrium solution by the employed social welfare criteria. The performance of the scheduler applied is verified by a number of numerical experiments. The related results show the effectiveness and scalability of the scheme in the presence of a large number of jobs and resources involved in the scheduling process.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 737-751
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Almost periodic synchronization of fuzzy cellular neural networks with time-varying delays via state-feedback and impulsive control
Autorzy:
Li, Yongkun
Wang, Huimei
Meng, Xiaofang
Powiązania:
https://bibliotekanauki.pl/articles/331017.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
almost periodic solution
fuzzy cellular neural networks
time varying delays
state feedback
impulsive control
rozwiązanie okresowe
sieć neuronowa
opóźnienie czasowe
sprzężenie zwrotne
Opis:
In this paper, we are concerned with drive-response synchronization for a class of fuzzy cellular neural networks with time varying delays. Based on the exponential dichotomy of linear differential equations, the Banach fixed point theorem and the differential inequality technique, we obtain the existence of almost periodic solutions of this class of networks. Then, we design a state feedback and an impulsive controller, and construct a suitable Lyapunov function to study the problem of global exponential almost periodic synchronization for the drive-response systems considered. At the end of the paper, we provide an example to verify the effectiveness of the theoretical results.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 2; 337-349
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
Autorzy:
Lopez-Loces, M. C.
Musial, J.
Pecero, J. E.
Fraire-Huacuja, H. J.
Blazewicz, J.
Bouvry, P.
Powiązania:
https://bibliotekanauki.pl/articles/330508.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
internet shopping optimization
integer linear programming
cellular processing algorithm
heuristic algorithms
optimization in e-commerce
zakupy internetowe
programowanie liniowe
algorytm heurystyczny
handel elektroniczny
Opis:
Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all the shops increases as well. In this paper we propose an integer linear programming (ILP) model and two heuristic solutions, the MinMin algorithm and the cellular processing algorithm, to tackle the Internet shopping optimization problem with delivery costs. The obtained results improve those achieved by the state-of-the-art heuristics, and for small real case scenarios ILP delivers exact solutions in a reasonable amount of time.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 391-406
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolving morphogenetic fields in the zebra skin pattern based on Turings morphogen hypothesis
Autorzy:
Gravan, C. P.
Lahoz-Beltra, R.
Powiązania:
https://bibliotekanauki.pl/articles/907636.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
pole morfogenetyczne
model reakcji-dyfuzji
automat komórkowy
mammalian coat pattern
morphogenetic field
Turing reaction-diffusion
evolving cellular automata
developmental models
modeling biological structures
Opis:
One of the classical problems of morphogenesis is to explain how patterns of different animals evolved resulting in a consolidated and stable pattern generation after generation. In this paper we simulated the evolution of two hypothetical morphogens, or proteins, that diffuse across a grid modeling the zebra skin pattern in an embryonic state, composed of pigmented and nonpigmented cells. The simulation experiments were carried out applying a genetic algorithm to the Young cellular automaton: a discrete version of the reaction-diffusion equations proposed by Turing in 1952. In the simulation experiments we searched for proper parameter values of two hypothetical proteins playing the role of activator and inhibitor morphogens. Our results show that on molecular and cellular levels recombination is the genetic mechanism that plays the key role in morphogen evolution, obtaining similar results in the presence or absence of mutation. However, spot patterns appear more often than stripe patterns on the simulated skin of zebras. Even when simulation results are consistent with the general picture of pattern modeling and simulation based on the Turing reaction-diffusion, we conclude that the stripe pattern of zebras may be a result of other biological features (i.e., genetic interactions, the Kipling hypothesis) not included in the present model.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 351-361
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cellular Automata and Many-Particle Systems Modeling Aggregation Behavior Among Populations
Autorzy:
Morale, D.
Powiązania:
https://bibliotekanauki.pl/articles/929762.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
równanie różniczkowe stochastyczne
równanie różniczkowo-całkowe
cellular automata
individual-based models
stochastic differential equations
law of large numbers
density dependence
nonlinear integrodifferential equations
Opis:
A cellular automaton model is presented in order to describe mutual interactions among the individuals of a population due to social decisions.The scheme is used for getting qualitative results, comparable to field experiments carried out on a population of ants which present an aggregative behavior. We also present a second description of a biological spatially structured population of N individuals by a system of stochastic differential equations of Ito type. A 'law of large numbers' to a continuum dynamics described by an integro-differential equation is given.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 1; 157-173
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Segmentation of breast cancer fine needle biopsy cytological images
Autorzy:
Hrebień, M.
Steć, P.
Nieczkowski, T.
Obuchowicz, A.
Powiązania:
https://bibliotekanauki.pl/articles/907946.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
segmentacja obrazów
algorytm działów wodnych
aktywne kontury
obraz cytologiczny
transformata Hough'a
automat komórkowy
metoda GrowCut
cytological image segmentation
Hough transform
watershed algorithm
active contours
cellular automata GrowCut method
Opis:
This paper describes three cytological image segmentation methods. The analysis includes the watershed algorithm, active contouring and a cellular automata GrowCut method. One can also find here a description of image pre-processing, Hough transform based pre-segmentation and an automatic nuclei localization mechanism used in our approach. Preliminary experimental results collected on a benchmark database present the quality of the methods in the analyzed issue. The discussion of common errors and possible future problems summarizes the work and points out regions that need further research.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 2; 159-170
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-7 z 7

    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