Refine your search
Collections
Co-Authors
Journals
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Rangarajan, K.
- Algorithm for Automaton Specification for Exploring Dynamic Labyrinths
Abstract Views :461 |
PDF Views:0
Authors
Affiliations
1 School of Computing, Bharath University, Chennai-600073
2 Dept of Computer Applications Bharath University, Chennai-600073
1 School of Computing, Bharath University, Chennai-600073
2 Dept of Computer Applications Bharath University, Chennai-600073
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4554-4559Abstract
A variety of interesting problems arise in the study of finite automata that move about in a two dimensional space. The model proposed by Muller [4] is used here to construct new automaton which can explore any labyrinth and escape through the moving or dynamic obstacles inside over the grid. The earlier results were shown for static obstacles distributed over integer grid and the automaton in this case was constructed to interact on the rectangular grid location endowed with four neighborhood directional states. In this paper we allow obstacles moving in discrete steps and verify that the finite automaton with just five printing symbols can escape or find the exit.Keywords
Labyrinths, Finite State Automaton, Printing Mouse, Free Way of EscapeFull Text
References
- Active-Robots (n.d.) (2008). Cruiser Maze Solver Robot. Available from: http://www.microrobot.co.kr, http://www.activerobots.com/products/robots/cruiser-details-2.shtml.
- Bruggemann B (2006). Entkommen aus unbekannten labyrinthen mit einbahnstrassen, Master’s thesis, Rheinische Friedrich Wilhelms Universität Bonn.
- Bruggemann B, Kamphans T et al. (2007). Leaving an unknown maze with one-way roads, in Abstracts 23nd European Workshop Computational Geometry, Graz, Austria, 90–93.
- Muller H (1977). A one symbol printing automation escaping from every labyrinth, Computing Springer Verlag, vol 19, 95–110.
- Muller H (1971). Endliche automaten und labyrinthen, Elecktronishe Informations verarbeitung und Kybernetik, vol 7(4), 261–264.
- Muller H (1971). Stack automaten in labyrinthen, Archiv Für Mathematische Logik Und Grundlagenforschung, vol 14 (3-4), 127–134.
- Nolfi S, and Floreano D (2000). Evolutionary robotics: the biology, intelligence, and technology of self-organizing machines (Intelligent Robotics and Autonomous Agents), Bradford Books.
- Introducing an Efficient Programming Paradigm for Object-oriented Distributed Systems
Abstract Views :371 |
PDF Views:0
Authors
Affiliations
1 Department of Information Technology, Bharath University, Chennai-600073
2 School of Computing, Bharath University, Chennai-73, IN
1 Department of Information Technology, Bharath University, Chennai-600073
2 School of Computing, Bharath University, Chennai-73, IN
Source
Indian Journal of Science and Technology, Vol 6, No S5 (2013), Pagination: 4596-4603Abstract
Implementing a distributed process using object oriented programming is challenging especially for clusters of nodes ensuring the availability. Java happens to be well suited for writing object oriented programs for applications which needs modularity and high degree of cohesion [2]. In this paper our objective is to propose appropriate programming paradigms for loosely coupled distributed and object-oriented systems with a specific focus on parallel programming and client-server object computing. We select a prototype tool made based on the research outcome as found in [1] for this purpose. This research prototype tool 'Vishwa' provides a very good starting point for graduate students, engineers and scientists in academia, industry and government to present their tasks using the aspects of parallel and distributed computing. The learning curve is shorter in the domain of grid due to the simplicity in deploying and processing with this tool. We also demonstrate with a case study for bringing out the easiness in splitting the given job into subtasks and executed in this type of grid environment.Keywords
Grid Computing, Distributed Computing, Object Oriented Programming, Speedup Ratio, MiddlewareFull Text
References
- Janakiram D (2010). Grid Computing, Research Monograph Tata Mcgraw-Hill Publishers.
- Srinivas V, and Janakiram D (2009). Node capability aware replica management for peer-to-peer grids, IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans, vol 39, No. 4, 807–818.
- Berman F, Fox G et al. (2003). Grid computing: making the global infrastructure a reality, 1st Edn., Wiley Series.
- Joseph, Joshy, and Fellenstein Craig (2003). Grid Computing, Prentice Hall PTR.
- Joseph J, Ernest M et al. (2004). Evolution of grid computing architecture and grid adoption models, IBM Systems Journal, vol 43(4), 624–645.
- Baker M, Apon A et al. (2005). Emerging Grid Standards, IEEE Computer, vol 38(4), 43–50.
- Eddy Carona et al. (2007). Definition, modeling and simulation of a grid computing scheduling system for high throughput computing, Future Generation Computer Systems, vol 23(8), 968–976.
- Parashar M, and Browne J C (2005). Conceptual and Implementation Models for the Grid, Proceedings of the IEEE, vol 93(3), 653–668.
- Atiknson M, Chervenal A et al. (2004). Data Access, Integration and Management, The Grid: Blueprint for a New Computing Infrastructure, Morgan Kauffmann.
- Chawathe Y, Ratnasamy S et al. (2003). Making Gnutella-like P2P Systems Scalable, SIGCOMM’03, Available From: http://dcg.ethz.ch/lectures/ws0506/seminar/papers/scalable_p2p.pdf
- Rowstron A, and Druschel P (2001). Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 329–350.
- Algorithmic Approach to the Length of the Words of String Token Petri Nets
Abstract Views :170 |
PDF Views:2
Authors
Affiliations
1 Sathyabama University, Jeppiar Nagar, Chennai-119, IN
2 S&H Department, Bharath University, Selaiyur, Chennai-73, IN
1 Sathyabama University, Jeppiar Nagar, Chennai-119, IN
2 S&H Department, Bharath University, Selaiyur, Chennai-73, IN
Source
Data Mining and Knowledge Engineering, Vol 3, No 6 (2011), Pagination: 387-390Abstract
In string token Petri nets (STPN), strings are used as tokens. In a Petri net, the sequence of firing of transitions which leads to the final marking forms a language. Whereas in string token Petri nets (STPN), the string in the final marking of STPN forms a language. Utilizing the concept of derivation in string languages, string token Petri net (STPN) derivation languages are studied. The ranking and unranking algorithm for the type of languages are discussed and complexity results are studied.
- Health Insurance in India: Factors Affecting Synergy among Insurers and Healthcare Providers
Abstract Views :408 |
PDF Views:0
Authors
Rohit Kumar
1,
K. Rangarajan
2
Affiliations
1 Indian Institute of Foreign Trade, J-1/14 (7th-9th Floor), EP & GP Block, Sector V, Salt Lake City, Kolkata 700091, IN
2 Centre for SME Studies, Kolkata 700091, IN
1 Indian Institute of Foreign Trade, J-1/14 (7th-9th Floor), EP & GP Block, Sector V, Salt Lake City, Kolkata 700091, IN
2 Centre for SME Studies, Kolkata 700091, IN