Skip to main content
Erschienen in: Pattern Analysis and Applications 2/2020

02.04.2019 | Theoretical advances

On enhancing the deadlock-preventing object migration automaton using the pursuit paradigm

verfasst von: Abdolreza Shirvani, B. John Oommen

Erschienen in: Pattern Analysis and Applications | Ausgabe 2/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Probably, the most reputed solution for partitioning, which has applications in databases, attribute partitioning, processor-based assignment and many other similar scenarios, is the object migration automata (OMA). However, one of the known deficiencies of the OMA is that when the problem size is large, i.e., the number of objects and partitions are large, the probability of receiving a reward, which “strengthens” the current partitioning, from the Environment is not significant. This is because of an internal deadlock scenario which is discussed in this paper. As a result of this, it can take the OMA a considerable number of iterations to recover from an inferior configuration. This property, which characterizes learning automaton (LA) in general, is especially true for the OMA-based methods. In spite of the fact that various solutions have been proposed to remedy this issue for general families of LA, overcoming this hurdle is a completely unexplored area of research for conceptualizing how the OMA should interact with the Environment. Indeed, the best reported version of the OMA, the enhanced OMA (EOMA), has been proposed to mitigate the consequent deadlock scenario. In this paper, we demonstrate that the incorporation of the intrinsic properties of the Environment into the OMA’s design leads to a higher learning capacity and to a more consistent partitioning. To achieve this, we incorporate the state-of-the-art pursuit principle utilized in the field of LA by estimating the Environment’s reward/penalty probabilities and using them to further augment the EOMA. We also verify the performance of our proposed method, referred to as the pursuit EOMA (PEOMA), through simulation, and demonstrate a significant increase in the convergence rate, i.e., by a factor of about forty. It also yields a noticeable reduction in sensitivity to the noise in the Environment. The paper also includes some results obtained for a real-world application domain involving faulty sensors.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
As we shall presently explain, it was specifically designed to learn the underlying clustering by means of “Rewards” and “Penalties” that are inferred from the way the objects are presented to the LA.
 
2
The survey of the field of LA, the OPP and the OMA is necessarily brief. A more detailed exegesis is found in the doctoral thesis of the first author [15].
 
3
To be consistent with the terminology of LA, we use the terms “action,” “class” and “group” synonymously.
 
4
To clarify issues, consider the following example: Consider the query \(\langle 3, 4 \rangle \) in Fig. 1. Since both objects \(O_3\) and \(O_4\) reside in the same group \(G_1\), they will be rewarded and moved deeper toward the most internal state.
 
5
The reader will observe that this is the total probability of \(\mathbb {E}\) presenting the pair \(\langle A_i, A_j \rangle \).
 
6
In this paper, we consider the “noise” to be uniform in nature. A smaller value of p implies a higher level of noise. This quantity is chosen such that the least amount of information is provided (i.e., one with the maximum entropy) to the partitioning algorithm. Any other distribution would lead to a faster partitioning, inasmuch as pairs referring to the same underlying partition will occur more frequently.
 
7
Although this was, indeed, the way that the experiments in [13] were conducted, it was not clearly communicated in that paper.
 
8
The description about how the original OMA simulation was carried out is given in [16].
 
9
Of course, such an Environment, although ideal, does not exist in a real-world scenario.
 
10
The theorems, in and of themselves, are identical to the ones used to incorporate the pursuit paradigm into the OMA [16]. We thus merely state the results and omit the detailed formal proofs.
 
11
One might argue that the order of the indices may not necessarily result in a block matrix, but rather in a sparse matrix. However, it can be easily seen that by an appropriate remapping of the indices, in which the elements of the partitioning \(\Omega ^*\) are adjacent, one can obtain such a block matrix.
 
12
Extending these results for a non-uniform setting is rather trivial
 
13
Of course, these estimates can be obtained using either a Maximum Likelihood or a Bayesian paradigm.
 
14
Please note that the matrix can be scrambled and it is rather trivial to group the elements into blocks as it is shown in the picture.
 
15
In our current implementation, whenever two objects are to be switched from their boundary states, we decide on the one to be moved by randomly tossing a coin.
 
16
The simulations in this paper were performed using the ‘R’ software, and the hardware used was a PC running Windows 10 operating system with Intel Core i5 CPU with 8 GBs of RAM.
 
17
The goal is that in the future [18], we will utilize, in an unsupervised manner the readings of the majority of the other remaining sensors, instead of an “Oracle,” to decide on a particular sensor’s “reliability.” After convergence has occurred, we can assume that we do not need the “Oracle” any more!
 
18
We are grateful to the anonymous Referee who requested this additional set of experiments.
 
Literatur
1.
Zurück zum Zitat Amer A, Oommen BJ (2007) A novel framework for self-organizing lists in environments with locality of reference: lists-on-lists. Comput J 50(2):186–196CrossRef Amer A, Oommen BJ (2007) A novel framework for self-organizing lists in environments with locality of reference: lists-on-lists. Comput J 50(2):186–196CrossRef
2.
Zurück zum Zitat Esnaashari M, Meybodi MR (2010) A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks. Comput Netw 54(14):2410–2438CrossRef Esnaashari M, Meybodi MR (2010) A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks. Comput Netw 54(14):2410–2438CrossRef
3.
Zurück zum Zitat Fayyoumi E, Oommen BJ (2009) Achieving microaggregation for secure statistical databases using fixed-structure partitioning-based learning automata. IEEE Trans Syst Man Cybern B 39(5):1192–1205CrossRef Fayyoumi E, Oommen BJ (2009) Achieving microaggregation for secure statistical databases using fixed-structure partitioning-based learning automata. IEEE Trans Syst Man Cybern B 39(5):1192–1205CrossRef
4.
Zurück zum Zitat Freuder EC (1971) The object partition problem. Vision Flash 4 Freuder EC (1971) The object partition problem. Vision Flash 4
5.
Zurück zum Zitat Gale W, Das S, Yu CT (1990) Improvements to an algorithm for equipartitioning. IEEE Trans Comput 39(5):706–710CrossRef Gale W, Das S, Yu CT (1990) Improvements to an algorithm for equipartitioning. IEEE Trans Comput 39(5):706–710CrossRef
6.
Zurück zum Zitat Hammer M, Chan A (1976) Index selection in a self-adaptive data base management system. In: Proceedings of the 1976 ACM SIGMOD international conference on management of data. ACM, pp 1–8 Hammer M, Chan A (1976) Index selection in a self-adaptive data base management system. In: Proceedings of the 1976 ACM SIGMOD international conference on management of data. ACM, pp 1–8
7.
Zurück zum Zitat Hammer M, Niamir B (1979) A heuristic approach to attribute partitioning. In: Proceedings of the 1979 ACM SIGMOD international conference on management of data. ACM, pp 93–101 Hammer M, Niamir B (1979) A heuristic approach to attribute partitioning. In: Proceedings of the 1979 ACM SIGMOD international conference on management of data. ACM, pp 93–101
8.
Zurück zum Zitat Jobava A (2015) Intelligent traffic-aware consolidation of virtual machines in a data center, Master’s thesis, University of Oslo Jobava A (2015) Intelligent traffic-aware consolidation of virtual machines in a data center, Master’s thesis, University of Oslo
9.
Zurück zum Zitat Ma DCY (1986) Object partitioning by using learning automata, Master’s thesis, Carleton University Ma DCY (1986) Object partitioning by using learning automata, Master’s thesis, Carleton University
10.
Zurück zum Zitat Mamaghani AS, Mahi M, Meybodi M (2010) A learning automaton based approach for data fragments allocation in distributed database systems. In: Proceedings of the 2010 IEEE 10th international conference on computer and information technology (CIT). IEEE, pp 8–12 Mamaghani AS, Mahi M, Meybodi M (2010) A learning automaton based approach for data fragments allocation in distributed database systems. In: Proceedings of the 2010 IEEE 10th international conference on computer and information technology (CIT). IEEE, pp 8–12
12.
Zurück zum Zitat Obaidat MS, Papadimitriou GI, Pomportsis AS (2002) Guest editorial learning automata: theory, paradigms, and applications. IEEE Trans Syst Man Cybern B 32(6):706–709CrossRef Obaidat MS, Papadimitriou GI, Pomportsis AS (2002) Guest editorial learning automata: theory, paradigms, and applications. IEEE Trans Syst Man Cybern B 32(6):706–709CrossRef
13.
Zurück zum Zitat Oommen BJ, Ma DCY (1988) Deterministic learning automata solutions to the equipartitioning problem. IEEE Trans Comput 37(1):2–13MathSciNetCrossRef Oommen BJ, Ma DCY (1988) Deterministic learning automata solutions to the equipartitioning problem. IEEE Trans Comput 37(1):2–13MathSciNetCrossRef
14.
Zurück zum Zitat Narendra KS, Thathachar MAL (2012) Learning automata: an introduction. Courier Corporation, North Chelmsford Narendra KS, Thathachar MAL (2012) Learning automata: an introduction. Courier Corporation, North Chelmsford
15.
Zurück zum Zitat Shirvani A (2017) Novel solutions and applications of the object partitioning problem. Ph.D. dissertation, Carleton University, Ottawa, Canada Shirvani A (2017) Novel solutions and applications of the object partitioning problem. Ph.D. dissertation, Carleton University, Ottawa, Canada
16.
Zurück zum Zitat Shirvani A, Oommen BJ (2018) On enhancing the object migration automaton using the pursuit paradigm. J Comput Sci 24:329–342MathSciNetCrossRef Shirvani A, Oommen BJ (2018) On enhancing the object migration automaton using the pursuit paradigm. J Comput Sci 24:329–342MathSciNetCrossRef
17.
Zurück zum Zitat Shirvani A, Oommen BJ (2017) On utilizing the pursuit paradigm to enhance the deadlock-preventing object migration automaton. In: Proceedings of ICTCS’17, the international conference on new trends in computing. IEEE Shirvani A, Oommen BJ (2017) On utilizing the pursuit paradigm to enhance the deadlock-preventing object migration automaton. In: Proceedings of ICTCS’17, the international conference on new trends in computing. IEEE
18.
Zurück zum Zitat Shirvani A, Oommen BJ, Yazidi A (2019) On resolving the “Unreliable Sensor” problem using the enhanced Object Migration Automata. In Preparation Shirvani A, Oommen BJ, Yazidi A (2019) On resolving the “Unreliable Sensor” problem using the enhanced Object Migration Automata. In Preparation
19.
Zurück zum Zitat Tsetlin M et al (1973) Automaton theory and modeling of biological systems. Academic Press, CambridgeMATH Tsetlin M et al (1973) Automaton theory and modeling of biological systems. Academic Press, CambridgeMATH
20.
Zurück zum Zitat Yazidi A, Granmo OC, Oommen BJ (2012) Service selection in stochastic environments: a learning-automaton based solution. Appl Intell 36(3):617–637CrossRef Yazidi A, Granmo OC, Oommen BJ (2012) Service selection in stochastic environments: a learning-automaton based solution. Appl Intell 36(3):617–637CrossRef
21.
Zurück zum Zitat Yu CT, Suen C, Lam K, Siu MK (1985) Adaptive record clustering. ACM Trans Database Syst (TODS) 10(2):180–204CrossRef Yu CT, Suen C, Lam K, Siu MK (1985) Adaptive record clustering. ACM Trans Database Syst (TODS) 10(2):180–204CrossRef
22.
Zurück zum Zitat Yu C, Siu M, Lam K, Tai F (1981) Adaptive clustering schemes: general framework. In: Proceedings of the IEEE COMPSAC conference, pp 81–89 Yu C, Siu M, Lam K, Tai F (1981) Adaptive clustering schemes: general framework. In: Proceedings of the IEEE COMPSAC conference, pp 81–89
23.
Zurück zum Zitat Zhang J, Wang Y, Wang C, Zhou M (2017) Fast variable structure stochastic automaton for discovering and tracking spatiotemporal event patterns. IEEE Trans Cybern 48:890–903CrossRef Zhang J, Wang Y, Wang C, Zhou M (2017) Fast variable structure stochastic automaton for discovering and tracking spatiotemporal event patterns. IEEE Trans Cybern 48:890–903CrossRef
Metadaten
Titel
On enhancing the deadlock-preventing object migration automaton using the pursuit paradigm
verfasst von
Abdolreza Shirvani
B. John Oommen
Publikationsdatum
02.04.2019
Verlag
Springer London
Erschienen in
Pattern Analysis and Applications / Ausgabe 2/2020
Print ISSN: 1433-7541
Elektronische ISSN: 1433-755X
DOI
https://doi.org/10.1007/s10044-019-00817-z

Weitere Artikel der Ausgabe 2/2020

Pattern Analysis and Applications 2/2020 Zur Ausgabe

Premium Partner