Study on PASS: A Parallel Activity-Search System
Main Article Content
Abstract
In this paper we investigate on set of activities presented via temporal stochastic automata, partitions of activities based on level based events, in this connection our investigation on issues with activity creations on temporal multi-activity graph in order to address this issues as our proposed system how system used PASS architecture with various implementation parts with that coordinates computations across nodes in the cluster and also shown that this algorithms enables to handle both large numbers of observations per second as well as large merged graphs. And also shown Partitioning times vs. TMAG size for different partitioning schemes and TMAG densities (sparseS, dense-D), averaged over number of compute nodes.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
M. Albanese, V. Moscato, A. Picariello, V. S. Subrahmanian, and O. Udrea, “Detecting stochastically scheduled activities in video,” in Proc. IJCAI, M. M. Veloso, Ed. San Francisco, CA, USA, 2007, pp. 1802– 1807.
S. Lühr, H. H. Bui, S. Venkatesh, and G. A. W. West, “Recognition of human activity through hierarchical stochastic learning,” in Proc. PerCom., Fort Worth, TX, USA, Mar. 2003, pp. 416–422.
T. Duong, H. Bui, D. Phung, and S. Venkatesh, “Activity recognition and abnormality detection with the switching hidden semi-Markov model,” in Proc. IEEE CVPR, Washington, DC, USA, 2005.
T. V. Duong, D. Q. Phung, H. H. Bui, and S. Venkatesh, “Efficient duration and hierarchical modeling for human activity recognition,” Artif. Intell., vol. 173, no. 7–8, pp. 830–856, May 2009.
R. Hamid, Y. Huang, and I. Essa, “ARGMode activity recognition using graphical models,” in Proc. IEEE CVPR, Madison, WI, USA, 2003.
M. Albanese, S. Jajodia, A. Pugliese, and V. S. Subrahmanian, “Scalable analysis of attack scenarios,” in Proc. ESORICS, Leuven, Belgium, 2011, pp. 416–433.
M. L. Fredman and R. E. Tarjan, “Fibonacci heaps and their uses in improved network optimization algorithms,” in Proc. FOCS, 1984, pp. 338–346.
G. Palshikar and M. Apte, “Collusion set detection using graph clustering,” Data Knowl. Eng., vol. 16, no. 1, pp. 135–164, 2008.
M. Albanese, A. Pugliese, and V. S. Subrahmanian, “Fast activity detection: Indexing for temporal stochastic automaton-based activity models,” IEEE Trans. Knowl. Data Eng., vol. 25, no. 2, pp. 360–373, Feb. 2013.