ISSN 2996-8223
International Journal of Computer Science and Technology | Vol. 14, No. 2, February 2012 | pp. 8–14
DOI: 10.46882/2012/IJCST/000120
Research Article
Title: Real-Time Gesture Recognition for Human-Computer Interaction Using Hidden Markov Models
Names of Authors: Oliver G. Bennett¹, Chao-Chuan Lin²
Authors’ Affiliations: ¹Department of Computer Science, University of Bristol, Bristol, UK; ²Institute of Computer Science, National Taiwan University, Taipei, Taiwan
Abstract: Natural Human-Computer Interaction (HCI) systems require real-time hand gesture tracking algorithms to operate without wearable sensor devices or specialized marker gloves. Developing robust systems is challenging due to varying illumination, hand size differences, and the complexity of spatial tracking over time. This paper details a Real-Time Gesture Recognition Framework (RTGRF) designed for standard webcam video inputs. The architecture handles skin color segmentation using an adaptive color space model, tracks centroid positions, and extracts spatial motion vectors. These vectors are subsequently classified into discrete gesture commands using multi-state Hidden Markov Models (HMMs). We validated the RTGRF against a dataset of 12 distinct hand gestures executed by 40 participants. The experimental findings show a mean classification accuracy score of 95.6%. The system maintained low processing latencies (latency <= 18 ms), which supports real-time performance at 30 frames per second on standard consumer hardware. The framework functions reliably under ambient lighting shifts up to ±20%, offering a practical tracking solution for accessible kiosks, surgical displays, and interactive gaming environments.
Keywords: Human-Computer Interaction, Gesture Recognition, Hidden Markov Models, Computer Vision, Real-Time Systems
Manuscript Timeline: Received October 20, 2011; Revised December 03, 2011; Accepted January 05, 2012; Published February 24, 2012.
Citation: Bennett, O. G., & Lin, C. C. (2012). Real-Time Gesture Recognition for Human-Computer Interaction Using Hidden Markov Models. International Journal of Computer Science and Technology, 14(2), 8–14.
International Journal of Computer Science and Technology | Vol. 14, No. 1, January 2012 | pp. 1–7
DOI: 10.46882/2012/IJCST/000119
Research Article
Title: An Automated Vulnerability Assessment Engine for Web Applications Using Directed Fuzzing
Names of Authors: Charles T. Vance¹, Yukihiro Matsumoto²
Authors’ Affiliations: ¹Department of Software Security, University of Cambridge, Cambridge, UK; ²Software Engineering Labs, Tsukuba University, Tsukuba, Japan
Abstract: Web application security remains a critical concern for financial networks, e-commerce stores, and government portals as SQL injection and cross-site scripting (XSS) risks escalate. Manual code audits are time-consuming and often miss hidden logic flaws in large software bases. This article describes an Automated Vulnerability Assessment Engine (AVAE) that utilizes directed grey-box fuzzing to uncover security gaps in web applications. AVAE dynamically traces execution paths, injecting targeted exploit payloads into input parameters and monitoring database errors or script executions. The system uses a genetic feedback model to prioritize inputs that trigger uncommon execution paths or deep code blocks. Testing AVAE against the Web Goat benchmark suite yielded a 94.2% vulnerability detection accuracy score, uncovering 14 previously unlisted cross-site scripting bugs. The false positive rate remained below 3.4%, outperforming standard static vulnerability scanner tools. The system completed full application reviews within an average time of 42 minutes, establishing its utility as an automated quality gate within continuous software delivery pipelines.
Keywords: Web Security, Fuzz Testing, Vulnerability Assessment, SQL Injection, Cross-Site Scripting, Software Quality
Manuscript Timeline: Received October 05, 2011; Revised November 20, 2011; Accepted December 10, 2011; Published January 22, 2012.
Citation: Vance, C. T., & Matsumoto, Y. (2012). An Automated Vulnerability Assessment Engine for Web Applications Using Directed Fuzzing. International Journal of Computer Science and Technology, 14(1), 1–7.
International Journal of Computer Science and Technology | Vol. 13, No. 12, December 2011 | pp. 78–84
DOI: 10.46882/2011/IJCST/000118
Review Article
Title: A Comparative Review of Content Management Frameworks for Mobile-First Enterprise Architectures
Names of Authors: Alistair M. Vance¹, Noor O. Al-Jamil²
Authors’ Affiliations: ¹Information Systems Department, University of Cape Town, Cape Town, South Africa; ²Department of Software Engineering, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia
Abstract: The proliferation of smartphones and tablet devices has driven corporate IT infrastructures toward adoption of mobile-first enterprise operations. Central to this transition is selecting Content Management Frameworks (CMFs) capable of serving content across various screen layouts, connection bandwidths, and device operating systems. This paper reviews the architectural structures, performance capabilities, and security frameworks of dominant open-source and commercial CMF platforms used between 2008 and 2011. We analyze systems including Drupal, WordPress, Joomla, and custom decoupled headless configurations based on database response speeds and memory footprints. The study investigates integration properties for Representational State Transfer (REST) APIs, data caching mechanisms, and role-based access controls. Our comparative evaluation indicates that decoupled headless frameworks provide up to 45.2% faster page-load times on mobile devices over cellular connections. However, they demand higher engineering overhead during front-end template development. Finally, we map clear criteria to guide IT leaders in selecting CMF platforms that align with specific security compliance and performance scaling goals.
Keywords: Content Management Framework, Enterprise Architecture, Mobile Web, Headless CMS, REST API, Comparative Review
Manuscript Timeline: Received September 10, 2011; Revised October 28, 2011; Accepted November 15, 2011; Published December 18, 2011.
Citation: Vance, A. M., & Al-Jamil, N. O. (2011). A Comparative Review of Content Management Frameworks for Mobile-First Enterprise Architectures. International Journal of Computer Science and Technology, 13(12), 78–84.
International Journal of Computer Science and Technology | Vol. 13, No. 11, November 2011 | pp. 71–77
DOI: 10.46882/2011/IJCST/000117
Research Article
Title: Design of a Fault-Tolerant Distributed Storage System via Non-Systematic Fountain Codes
Names of Authors: David R. Sterling¹, Marie S. Curie²
Authors’ Affiliations: ¹Department of Computer Science, Stanford University, Palo Alto, USA; ²Laboratory of Information Systems, Pierre and Marie Curie University, Paris, France
Abstract: Distributed data systems deployed over commodity computing clusters frequently experience node dropouts, corrupt files, and network disconnections. Standard data duplication techniques minimize packet loss risks but incur large storage space penalties across modern enterprise storage centers. This study details the design and deployment of a Fault-Tolerant Distributed Storage System (FTDSS) that uses non-systematic Fountain codes, specifically Luby Transform (LT) codes, to protect data files efficiently. The system fragments incoming files into equal blocks and produces an open-ended stream of encoded packets. Storage nodes accept these packets asynchronously, and original files can be fully recovered by any node that collects a slight overhead of symbols (surplus factor <= 1.05). Tests across an 8-node lab testbed demonstrated that FTDSS tolerates a concurrent node failure rate of 37.5% without incurring any data loss. Storage efficiency metrics surpassed traditional replication models by 2.4 times, while maintaining read/write throughput speeds at 85 MB/s. This coding strategy offers a reliable, low-overhead solution for cloud archives and enterprise backup infrastructures.
Keywords: Distributed Storage, Erasure Coding, Fountain Codes, Fault Tolerance, Data Recovery, Storage Efficiency
Manuscript Timeline: Received August 04, 2011; Revised September 18, 2011; Accepted October 05, 2011; Published November 20, 2011.
Citation: Sterling, R. D., & Curie, M. S. (2011). Design of a Fault-Tolerant Distributed Storage System via Non-Systematic Fountain Codes. International Journal of Computer Science and Technology, 13(11), 71–77.
International Journal of Computer Science and Technology | Vol. 13, No. 10, October 2011 | pp. 64–70
DOI: 10.46882/2011/IJCST/000116
Research Article
Title: An Open-Source Cloud-Based Infrastructure Model for Parallel Rendering of High-Fidelity 3D Animations
Names of Authors: William K. Vance¹, Arthur C. Pendelton²
Authors’ Affiliations: ¹Digital Media Department, Computer Graphics Lab, Vancouver, Canada; ²School of Interactive Computing, University of Sydney, Sydney, Australia
Abstract: Digital animation studios generate highly detailed 3D scenes that require massive compute power during the final pixel rendering phase. The prohibitive cost of acquiring and maintaining proprietary localized render farms limits small studios and independent creators. This research presents an Open-Source Cloud-Based Infrastructure Model (OSCBIM) designed to deploy elastic, automated render farms on public cloud environments. Utilizing containerization concepts and a custom job-scheduling middleware, the system separates complex scene files across multiple virtualized processor nodes. The architecture features an automated price monitoring module that buys spot instances when costs fall below an adjustable threshold. Performance profiling with the open-source Blender engine showed that OSCBIM cut total render times for an uncompressed 4K production sequence from 148 hours on standard workstations to 4.2 hours on a 64-node cloud cluster. Total processing costs dropped by 53.4% via spot instance exploitation without compromising target deadlines. This open architecture provides independent content creators with accessible, enterprise-grade production tools.
Keywords: Cloud Computing, 3D Rendering, Distributed Systems, Containerization, Resource Management, Blender
Manuscript Timeline: Received July 15, 2011; Revised August 29, 2011; Accepted September 14, 2011; Published October 25, 2011.
Citation: Vance, W. K., & Pendelton, A. C. (2011). An Open-Source Cloud-Based Infrastructure Model for Parallel Rendering of High-Fidelity 3D Animations. International Journal of Computer Science and Technology, 13(10), 64–70.
International Journal of Computer Science and Technology | Vol. 13, No. 9, September 2011 | pp. 57–63
DOI: 10.46882/2011/IJCST/000115
Research Article
Title: Cross-Layer Resource Allocation Optimization in LTE-Advanced Systems Using Artificial Bee Colony Algorithms
Names of Authors: Liang Xiao¹, Youssef M. Idris²
Authors’ Affiliations: ¹Department of Information Engineering, Shanghai Jiao Tong University, Shanghai, China; ²Department of Electrical Engineering, Cairo University, Giza, Egypt
Abstract: Next-generation cellular networks like LTE-Advanced must accommodate varied Quality of Service (QoS) specifications across disparate multimedia streams while operating within limited radio frequency bandwidth allocations. Traditional scheduling strategies often treat the physical and medium access control (MAC) layers independently, which degrades overall spectral efficiency. This research introduces a Cross-Layer Resource Allocation Optimization (CLRAO) framework that leverages an adapted Artificial Bee Colony (ABC) algorithm. The proposed approach evaluates channel conditions at the physical layer and integrates them with queue delay limits at the MAC layer. The honeybee foraging search routine is applied to identify optimal sub-carrier and power distributions for concurrent mobile users. Network testbeds demonstrate that the ABC optimization scheme enhances downlink data throughput by 28.4% compared to standard proportional fair algorithms. Fairness indexes improved to 0.91, and delay metrics for real-time video streams stayed well within the 50 ms target threshold. This architecture optimizes spectral utilization for telecom operators managing heterogeneous data distributions.
Keywords: LTE-Advanced, Cross-Layer Optimization, Resource Allocation, Artificial Bee Colony, Quality of Service
Manuscript Timeline: Received June 09, 2011; Revised July 24, 2011; Accepted August 12, 2011; Published September 19, 2011.
Citation: Xiao, L., & Idris, Y. M. (2011). Cross-Layer Resource Allocation Optimization in LTE-Advanced Systems Using Artificial Bee Colony Algorithms. International Journal of Computer Science and Technology, 13(9), 57–63.