Affiliations M.Tech (CS), Department of Computer Science & EngineeringAssistant Professor, Department of Computer Science & Engineering, Sri Indu Institute of Engineering and Technology, R.R Dist Telengana, India
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.
MADIPADIGA VENKATESH,V .RAMESH."Study on PASS: A Parallel Activity-Search System". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 11,pp.785-790, November- 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1118.pdf,
 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.
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.