scholarly journals A METHOD FOR CHOOSING A STRATEGY FOR THE BEHAVIOR OF A CELLULAR AUTOMATON WHEN SOLVING THE PROBLEM OF FINDING TARGETS BY A GROUP OF MOVING OBJECTS

2021 ◽  
Vol 5 (4) ◽  
pp. 42-48
Author(s):  
Valerii Chystov ◽  
Iryna Zakharchenko ◽  
Vladislava Pavlenko ◽  
Maksim Pavlenko

Currently, a large number of different mathematical models and methods aimed at solving problems of multidimensional optimization and modeling of complex behavioral systems have been developed. One of the areas of search for solutions is the search for solutions in conditions of incomplete information and the need to take into account changing external factors. Often such problems are solved by the method of complete search. In some conditions, the method of complete search can be significantly improved through the implementation and use of behavioral models of natural formations. Examples of such formations can be group behavior of insects, birds, fish, various flocks, etc. The idea of copying group activity of a shoal of fishes at the decision of problems of joint activity on extraction of food is used in work. The reasoning based on the simulation of the behavior of such a natural object allowed to justify the choice as a mathematical model - cellular automata. The paper examines the key features of such a model. Modeling of his work is carried out, strategies of behavior of group of mobile objects at search of the purposes are developed, key characteristics are investigated and the method of adaptive choice of strategy and change of rules of behavior taking into account features of the solved problem is developed. The search strategy is implemented in the work, which takes into account the need to solve the optimization problem on two parameters. The obtained results testify to the high descriptive possibility of such an approach, the possibility of finding the optimal strategy for the behavior of the cellular automaton and the formalization of the process of selecting the parameters of its operation. A further improvement of this approach can be the implementation of simulation to study the properties of the developed model, the formation of the optimal set of rules and parameters of the machine for the whole set of tasks.

Author(s):  
Thu Thu Zan ◽  
Sabai Phyu

Today, the number of researches based on the data they move known as mobile objects indexing came out from the traditional static one. There are some indexing approaches to handle the complicated moving positions. One of the suitable ideas is pre-ordering these objects before building index structure. In this paper, a structure, a presorted-nearest index tree algorithm is proposed that allowed maintaining, updating, and range querying mobile objects within the desired period. Besides, it gives the advantage of an index structure to easy data access and fast query along with the retrieving nearest locations from a location point in the index structure. A synthetic mobile position dataset is also proposed for performance evaluation so that it is free from location privacy and confidentiality. The detail experimental results are discussed together with the performance evaluation of KDtree-based index structure. Both approaches are similarly efficient in range searching. However, the proposed approach is especially much more save time for the nearest neighbor search within a range than KD tree-based calculation.


2003 ◽  
Vol 125 (2) ◽  
pp. 273-281 ◽  
Author(s):  
K. O. Homan

The stably-stratified filling of an enclosure produces an interfacial layer, or thermocline, separating the hot and cold fluid volumes which is transported through the vessel with the bulk flow. The evolution of this interfacial layer is characterized by profile asymmetries and growth rates not explained by simple molecular diffusion. The present paper presents integral solutions to the horizontally-averaged energy equation with variable diffusivities exhibiting these same characteristics. The formulation requires only two parameters in addition to those of the uniform diffusivity case. The solutions are compared to published data to illustrate determination of the empirical constants and show that key characteristics of the model, specifically a constant fill-line temperature and symmetric growth rates, are satisfied for a range of moderate flow rates. At higher flow rates, the layers are seen to exhibit an increasingly higher degree of growth rate asymmetry.


1996 ◽  
Vol 29 (4) ◽  
pp. 689-699 ◽  
Author(s):  
I. Karafyllidis ◽  
I. Andreadis ◽  
P. Tzionas ◽  
Ph. Tsalides ◽  
A. Thanailakis

Author(s):  
Michael Seitz ◽  
Gerta Köster ◽  
Alexander Pfaffinger

2005 ◽  
Vol 02 (03) ◽  
pp. 227-239 ◽  
Author(s):  
YOUFU WU ◽  
MO DAI

In this paper, we address the problem of detection and analysis of moving objects in a video stream obtained by a fixed camera. To detect the moving objects, the tradition method is to create a fixed image first, which includes all the motionless parts of the scene, known as the background model. The difficulty of this approach lies mainly in two aspects: The first relates to the fact that a slow moving object can leave a visible trace in background model. The latter comes from the variation of illumination in the course of time so it cannot obtain a reasonable background model. To overcome these difficulties, we propose a multiple background model. At the exit of the detection of moving objects, the tracking (matching) of a moving object extracted in the successive images is necessary to analyze its behavior. After the matching of mobile objects, a series of analysis methods are presented. The proposed tracking and analysis methods allow dealing with partial occlusions, stopping and going motion, moving directions, crossing of moving object in very challenging situations. The experiment and comparison results are reported for different real sequences, which show better performance of our methods.


1994 ◽  
Vol 05 (03) ◽  
pp. 537-545 ◽  
Author(s):  
N. BOCCARA ◽  
J. NASSER ◽  
M. ROGER

We study the critical behavior of a probabilistic automata network whose local rule consists of two subrules. The first one, applied synchronously, is a probabilistic one-dimensional range-one cellular automaton rule. The second, applied sequentially, exchanges the values of a pair of sites. According to whether the two sites are first-neighbors or not, the exchange is said to be local or nonlocal. The evolution of the system depends upon two parameters, the probability p characterizing the probabilistic cellular automaton, and the degree of mixing m resulting from the exchange process. Depending upon the values of these parameters, the system exhibits a bifurcation similar to a second order phase transition characterized by a nonnegative order parameter, whose role is played by the stationary density of occupied sites. When m is very large, the correlations created by the application of the probabilistic cellular automaton rule are destroyed, and, as expected, the behavior of the system is then correctly predicted by a mean-field-type approximation. According to whether the exchange of the site values is local or nonlocal, the critical behavior is qualitatively different as m varies.


2011 ◽  
pp. 315-338
Author(s):  
Panayiotis Bozanis

Mobile computing emerged as a new application area due to recent advances in communication and positioning technology. As David Lomet (2002) notices, a substantial part of the conducted work refers to keeping track of the position of moving objects (automobiles, people, etc.) at any point in time. This information is very critical for decision making, and, since objects’ locations may change with relatively high frequency, this calls for providing fast access to object location information, thus rendering the indexing of moving objects a very interesting as well as crucial part of the area. In this chapter we present an overview on advances made in databases during the last few years in the area of mobile object indexing, and discuss issues that remain open or, probably, are interesting for related applications.


Author(s):  
Panayiotis Bozanis

The past few years have shown a significant increase in the volume and diversity of data stored in database management systems. Among these are spatiotemporal data, one of the faster developing categories of data. This phenomenon can be attributed to the flurry of application development concerning continuously evolving spatial objects in several areas: mobile communication systems, military equipment in battlefields, air traffic, truck fleets, and others. In standard database applications, data remain unchanged unless an update is explicitly stated. Applying this mode of operation to constantly moving objects would require frequent updates to be performed; otherwise, the database would be inaccurate and unreliable. In order to capture continuous movement and to avoid unnecessary updates, object positions are stored as time-dependent functions, requiring updates only when a function parameter changes. The moving objects are considered responsible for updating the database about alterations in their movement. In the following article is a short review on basic indexing schemes for accommodating moving objects in database systems so that complex queries about their location in the past, present, and future can be served.


2021 ◽  
Vol 18 (4) ◽  
pp. 0-0

In this manuscript, an Intelligent and Adaptive Web Page Recommender System is proposed that provides personalized, global and group mode of recommendations. The authors enhance the utility of a trie node for storing relevant web access statistics. The trie node enables dynamic clustering of users based on their evolving browsing patterns and allows a user to belong to multiple groups at each navigation step. The system takes cues from the field of crowd psychology to augment two parameters for modeling group behavior: Uniformity and Recommendation strength. The system continuously tracks the user’s responses in order to adaptively switch between different recommendation-criteria in the group and personalized modes. The experimental results illustrate that the system achieved the maximum F1 measure of 83.28% on CTI dataset which is a significant improvement over the 70% F1 measure reported by Automatic Clustering-based Genetic Algorithm, the prior web recommender system.


Sign in / Sign up

Export Citation Format

Share Document