. Kruse, “On merging and dividing of barabasi-albert-graphs,” in Evolving and Autonomous Learning Systems (EALS), 2014 IEEE Symposium on. IEEE, Dec. 2014, pp. 17-24.  P. Holme and B. J. Kim, “Growing scale-free networks with tunable clustering,” Physical review E, vol. 65, no. 2, p. 026107, 2002.  G. Bianconi and A.-l. BarabÃa˛si, “Competition and multiscaling in evolving networks,” Europhysics Letters, vol. 54, p. 436â˘A ¸S442, May 2001.  E. N. Gilbert, “Random graphs,” The Annals of Mathematical Statistics, pp. 1141-1144, 1959.  R. Kruse, C. Borgelt, F
-theoretic approach to multi-robot mapping and exploration," in IEEE/RSJ International Conference on Intelligent Robots and Systems , October 2003. Nevada, 2003, pp. 3232-3238. K. Konolige, et al., "Map merging for distributed robot navigation," in IEEE/RSJ International Conference on Intelligent Robots and Systems , October 2003. Nevada, 2003, pp. 212-217. R. Madhavan, K. Fregene, and L. E. Parker, "Distributed heterogeneous outdoor multi-robot localization," in IEEE International Conference on Robotics and Automation , May 2002. Washington, 2002, pp. 374-381. S. I. Roumeliotis
References J. Ko, B. Stewart, D. Fox, K. Konolige, B. Limketkai "A practical decision-theoretic approach to multi-robot mapping and exploration," in IEEE/RSJ International Conference on Intelligent Robots and Systems , 2003, pp. 3232-3238. S. Thrun "Robotic Mapping: A Survey," in Exploring Artificial Intelligence in the New Millennium , Morgan Kaufmann, 2002, pp. 1-35. A. Birk and S. Carpin "Merging Occupancy Grid Maps From Multiple Robots," Proceedings of the IEEE , IEEE, 94. vol., 2006, pp. 1384-1397. R. Siegwart and I. R. Nourbakhsh Introduction to
-Heidelberg: Springer- Verlag, 2007, 333 p.  Fellbaum C. (Ed.). WordNet: An Electronic Lexical Database. Cambridge, MA: MIT Press, 1998, 422 p.  Moser T., Schimper K., Mordinyi R., Anjomshoaa A. SAMOA - A Semi-automated Ontology Alignment Method for Systems Integration in Safety-critical Environments. International Conference on Complex, Intelligent and Software Intensive Systems, Fukuoka, Japan, 16-19 March 2009, pp. 724-729.  Fridman Noy N., Musen M.A. PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment, In Proceedings of the 17th National Conference
References  J. Ko, B. Stewart, D. Fox, K. Konolige, B. Limketkai “A practical decision-theoretic approach to multi-robot mapping and exploration,” in IEEE/RSJ International Conference on Intelligent Robots and Systems , 2003, pp. 3232-3238.  I. Andersone “The Characteristics of the Map Merging Methods: A Survey”. in the Scientific Journal of Riga Technical university , 5th Series, Applied Computer Systems, volume 43, RTU, Riga, 2010, pp. 113-121.  A. Birk and S. Carpin “Merging Occupancy Grid Maps From Multiple Robots,” Proceedings of the IEEE , IEEE
multivariate observations,” Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pp. 281-297, 1967.W540W4226  H. Vinod, ”Integer programming and the theory of grouping,” Journal of the American Statistical Association, vol. 64, pp. 506-519, 1969.W540W4226  Anil K. Jain, ”Data Clustering: 50 Years Beyond K-Means,” Pattern Recognition Letters, 2009.W540W4226  Zhiwu Huang, DongZhan Zhang, and JiangJiao Duan, ”BNAK-Divide-and-Merge Clustering Algorithm,” in ICISE ’09 Proceedings of the 2009 First IEEE International Conference on
footwear where microcapsules are implanted, so as to prevent destroying the footwear too early [ 2 ]. 3.3 Merging the requirements for footwear design, functionalization, and environmental protection In designing haute couture footwear, the accent is usually on new and different shapes of footwear, new shapes of soles and heels, new cuts, material combinations and variations, trimmings, and decorations ( Figure 1 ), while functional treatments of the material involved are in most cases taken for granted, as high fashion prefers the usage of high-quality materials that
In this paper we emphasize a similarity between the logarithmic type image processing (LTIP) model and the Naka–Rushton model of the human visual system (HVS). LTIP is a derivation of logarithmic image processing (LIP), which further replaces the logarithmic function with a ratio of polynomial functions. Based on this similarity, we show that it is possible to present a unifying framework for the high dynamic range (HDR) imaging problem, namely, that performing exposure merging under the LTIP model is equivalent to standard irradiance map fusion. The resulting HDR algorithm is shown to provide high quality in both subjective and objective evaluations.
This paper argues that various important results of formal language theory (e.g., the so-called Chomsky Hierarchy) may in fact be illusory as far as the human language faculty is concerned, as has been repeatedly emphasized by Chomsky himself. The paper takes up nested dependencies and cross-serial dependencies, the two important dependencies that typically show up in the discussion of the central classes of grammars and languages, and specifically shows that the fact that nested dependencies abound in human language while cross-serial dependencies are rather limited in human language can be naturally explained if we shift our attention from dependencies defined on terminal strings to abstract structures behind them. The paper then shows that nested dependencies are readily obtained by Merge, applying phase-by-phase, whereas cross-serial dependencies are available only as a result of copying Merge, which requires a constituency of the relevant strings. These results strongly suggest that dependencies are possible in human language only to the extent that they are the results from the structures that can be generated by Merge, leading to the conclusion that it is Merge-generability that determines various dependencies in human language, and that dependencies defined on the terminal strings are indeed illusory. A possible brain science experiment to demonstrate this point is also suggested.
Various aspects of merging the chosen presentation methods (choropleth and diagram) on one map are discussed in the article. Attention is focused on the graphic match of both methods, on the character and reference of data presented in this manner. Examples of such matches are shown, from the simplest application to complicated anamorphic presentations.