International Journal of Computer Science and Technology

International Journal of Computer Science and Technology | Vol. 7, No. 7, July 2005 | pp. 49–56

DOI: 10.46882/2005/IJCST/070710

Research Article

Title: Semantic Web Service Discovery Using Description Logics and Ontology Mapping Filters

Names of Authors: Alessandro Rossi¹, Lin Wei²

Authors’ Affiliations: ¹Dipartimento di Informatica, Università di Pisa, Pisa, Italy; ²Department of Computer Science and Technology, Tsinghua University, Beijing, China

Abstract:
Standard registry-based discovery methods for web services often miss highly compatible options because they match text strings rather than evaluating semantic concepts. This paper outlines an advanced semantic web service discovery mechanism that evaluates functional profiles using Description Logics (DL) syntax and structural ontology mapping rules. The system measures degree-of-match variables (Exact, Plug-in, Subsumes, Fail) by traversing taxonomic paths within Web Ontology Language for Services (OWL-S) profiles. Benchmarked against the OWL-S TC2 repository dataset, the proposed semantic selection engine achieved an overall precision rating of P = 91.3% and a recall metric of R = 87.5%, outperforming standard keyword-matching registries by more than 35%. The execution latency required to process semantic matchmaking operations scale linearly at O(N) relative to registry size, validating the framework's capability to power automated service composition workflows in distributed enterprise systems.

Keywords: Semantic Web Services, Ontology Mapping, Description Logics, OWL-S, Service Discovery

Manuscript Timeline: Received April 02, 2005; Revised May 14, 2005; Accepted June 11, 2005; Published July 25, 2005

Citation: Rossi, A., & Wei, L. (2005). Semantic Web Service Discovery Using Description Logics and Ontology Mapping Filters. International Journal of Computer Science and Technology, 7(7), 49–56.

International Journal of Computer Science and Technology | Vol. 7, No. 6, June 2005 | pp. 41–48

DOI: 10.46882/2005/IJCST/070609

Research Article

Title: An Intrusion Detection System for Cloud Environments Based on Hypervisor-Level Introspection

Names of Authors: David Miller¹, Siti Aminah²

Authors’ Affiliations: ¹Department of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA; ²School of Computing, Universiti Teknologi Malaysia, Johor Bahru, Malaysia

Abstract:
Traditional network-based intrusion detection frameworks are often unable to detect sophisticated attacks running inside virtualized cloud server nodes. This study details a host-level intrusion detection system (IDS) that operates via virtual machine introspection (VMI) at the hypervisor layer, completely isolated from the monitored guest operating systems. The software captures kernel data structures and memory allocations in real-time, matching changes against known malicious control-flow patterns. Testing within a Xen-hypervisor environment exposed to rootkit injection scripts demonstrated a true positive detection accuracy rate of 99.1%, while maintaining a low false alarm rate of 0.04%. Because the monitoring processes are decoupled from the target virtual machine, attackers cannot tamper with or disable the logging system. The hypervisor monitoring execution loop adds a minor performance penalty of just 2.3% on guest CPU workloads, ensuring the security model remains practical for enterprise cloud service provider deployment.

Keywords: Cloud Computing, Virtual Machine Introspection, Intrusion Detection, Hypervisor Security, Virtualization

Manuscript Timeline: Received March 14, 2005; Revised April 28, 2005; Accepted May 19, 2005; Published June 23, 2005

Citation: Miller, D., & Aminah, S. (2005). An Intrusion Detection System for Cloud Environments Based on Hypervisor-Level Introspection. International Journal of Computer Science and Technology, 7(6), 41–48.

International Journal of Computer Science and Technology | Vol. 7, No. 5, May 2005 | pp. 33–40

DOI: 10.46882/2005/IJCST/070508

Research Article

Title: High-Performance Parallel Simulation of Fluid Dynamics on Cluster Architectures Using MPI

Names of Authors: Guillaume Mercier¹, Aparna Rao²

Authors’ Affiliations: ¹Département d'Informatique, École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland; ²Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India

Abstract:
Simulating complex fluid dynamics variables requires significant computational resources, often necessitating high-performance parallel computing solutions. This paper implements a parallelized Navier-Stokes equation solver across distributed-memory cluster setups using the Message Passing Interface (MPI) framework. The computational space is divided using a 3D block-decomposition algorithm designed to minimize border communication overhead between processing ranks. Evaluation on a 64-node Linux cluster system achieved a parallel execution speedup efficiency metric of E = 87.5% when scaling up to maximum core allocations. The processing latency added by inter-node network communication was kept exceptionally low at less than 6.2% of total operational runtimes. This was achieved by using non-blocking MPI communication primitives (MPI_Isend and MPI_Irecv) to overlap computational steps with network data transfers. The framework can compute complex mesh structures exceeding 10⁸ elements, providing a scalable backbone for industrial aerodynamic design testing.

Keywords: Parallel Computing, Fluid Dynamics, MPI, Domain Decomposition, Scalability, Computational Grids

Manuscript Timeline: Received February 10, 2005; Revised March 24, 2005; Accepted April 15, 2005; Published May 26, 2005

Citation: Mercier, G., & Rao, A. (2005). High-Performance Parallel Simulation of Fluid Dynamics on Cluster Architectures Using MPI. International Journal of Computer Science and Technology, 7(5), 33–40.

International Journal of Computer Science and Technology | Vol. 7, No. 4, April 2005 | pp. 25–32

DOI: 10.46882/2005/IJCST/070407

Research Article

Title: Content-Based Image Retrieval Using Color Co-occurrence Matrices and Wavelet Transform Subbands

Names of Authors: Min-Seok Kim¹, Fatma Al-Jahani²

Authors’ Affiliations: ¹Department of Computer Science and Engineering, Seoul National University, Seoul, South Korea; ²Department of Computer Science, Qatar University, Doha, Qatar

Abstract:
As large digital image repositories become increasingly common, standard textual indexing approaches are no longer sufficient for precise image search and retrieval. This paper presents an integrated Content-Based Image Retrieval (CBIR) method that captures spatial color structures and high-frequency textural properties simultaneously. Spatial color distributions are computed using customized Color Co-occurrence Matrices (CCCM), while micro-texture feature extractions are derived from Discrete Wavelet Transform (DWT) subband coefficient variances. The system was validated against the Corel 1,000-image benchmark dataset. Experimental results demonstrate a mean precision rate of P = 89.4% and a recall index of R = 82.1% across ten distinct semantic image categories. This configuration outperformed standard color histogram indexing frameworks by 16.3% in precision. The average indexing query response execution time was recorded at t = 68 ms per retrieval iteration, establishing a reliable baseline for large-scale multimedia search tasks.

Keywords: Content-Based Image Retrieval, Color Co-occurrence Matrix, Discrete Wavelet Transform, Texture Features, Multimedia Databases

Manuscript Timeline: Received January 05, 2005; Revised February 18, 2005; Accepted March 12, 2005; Published April 21, 2005

Citation: Kim, M. S., & Al-Jahani, F. (2005). Content-Based Image Retrieval Using Color Co-occurrence Matrices and Wavelet Transform Subbands. International Journal of Computer Science and Technology, 7(4), 25–32.

International Journal of Computer Science and Technology | Vol. 7, No. 3, March 2005 | pp. 17–24

DOI: 10.46882/2005/IJCST/070306

Research Article

Title: An Evolutionary Approach to Automated Software Test Case Generation Using Genetic Algorithms

Names of Authors: Hans-Werner Schmidt¹, Clara Mendonça²

Authors’ Affiliations: ¹Institut für Informatik, Technische Universität München, Munich, Germany; ²Departamento de Informática, Universidade de São Paulo, São Paulo, Brazil

Abstract:
Manual generation of comprehensive test suites for software validation is often error-prone and consumes significant developer hours. This paper details an automated framework that leverages Genetic Algorithms (GAs) to synthesize structurally optimal test cases based on branch coverage criteria. The fitness function balances control flow graph complexity with path coverage milestones to guide the evolutionary selection process. The system was benchmarked against five open-source Java projects containing a cumulative total of more than 15,000 lines of code. The genetic engine reached a comprehensive branch coverage metric of 94.7% within an execution window of G = 120 generations, a significant improvement over random generation techniques which plateaued at 61.2%. The rate of redundant test case generation was reduced to less than 4.5%, directly lowering the computational load needed for full software regression testing passes.

Keywords: Automated Software Testing, Genetic Algorithms, Branch Coverage, Evolutionary Computing, Test Case Generation

Manuscript Timeline: Received December 08, 2004; Revised January 22, 2005; Accepted February 15, 2005; Published March 25, 2005

Citation: Schmidt, H. W., & Mendonça, C. (2005). An Evolutionary Approach to Automated Software Test Case Generation Using Genetic Algorithms. International Journal of Computer Science and Technology, 7(3), 17–24.

International Journal of Computer Science and Technology | Vol. 7, No. 2, February 2005 | pp. 9–16

DOI: 10.46882/2005/IJCST/070205

Research Article

Title: Cross-Layer Power Control Optimization for Energy-Efficient Wireless Sensor Networks

Names of Authors: Khalid Al-Mansoor¹, Emily Watson²

Authors’ Affiliations: ¹Department of Computer Engineering, King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia; ²Department of Computer Science, Stanford University, California, USA

Abstract:
Maximizing operational lifetime in battery-powered wireless sensor networks (WSNs) requires careful energy conservation strategies across multiple protocol layers. This paper establishes an adaptive cross-layer power control protocol (CPCP) that matches transmission power modifications at the Physical (PHY) layer with medium access control slot updates at the Data Link layer. The mathematical model relies on a stochastic game-theoretic design to converge toward Nash equilibrium states regarding energy consumption and packet delivery ratios. Network simulations consisting of 200 sensor nodes distributed randomly across a 500m x 500m area show that CPCP extends the average functional network lifetime by 34.2% compared to standard duty-cycle protocols like S-MAC. The total packet drop rate caused by spatial interference fell by 22.5%, while the mean power consumption per node stabilized at a nominal value of P = 14.8 μW. These improvements were achieved without increasing end-to-end multi-hop propagation latency benchmarks.

Keywords: Wireless Sensor Networks, Cross-Layer Design, Power Control, Game Theory, Energy Efficiency

Manuscript Timeline: Received November 02, 2004; Revised December 14, 2004; Accepted January 10, 2005; Published February 24, 2005

Citation: Al-Mansoor, K., & Watson, E. (2005). Cross-Layer Power Control Optimization for Energy-Efficient Wireless Sensor Networks. International Journal of Computer Science and Technology, 7(2), 9–16.