International Journal of Computer Science and Technology

International Journal of Computer Science and Technology Vol. 2, No. 8, August 2000 | pp. 57–64

DOI: 10.46882/2000/IJCST/000020

Research Article

Title: A Balanced Topological Graph Partitioning Scheme for Distributed Web-Scraping Engines

Names of Authors: Sarah Jenkins¹, Vikram Rao²

Authors’ Affiliations: ¹Department of Computer Science, Columbia University, New York, USA; ²School of Computer Science and Automation, Indian Institute of Science, Bangalore, India.

Abstract:
Distributed web-crawlers and indexing engines struggle with intense network overhead and unbalanced resource distribution when downloading massive structural maps of the internet. The primary operational bottleneck involves assigning interconnected hyperlink schemas across independent physical nodes without generating heavy cross-partition lookups that degrade server processing cycles. This paper outlines an optimized graph-partitioning scheme, Balanced Hyperlink Cut (BHC), specifically engineered to handle power-law web graphs containing highly referenced domain nodes. The algorithm tracks domain boundary relationships and evenly balances physical storage weights while minimizing the inter-node page replication factor. We deployed the BHC framework across a distributed cloud harvesting cluster and evaluated indexing timelines using a raw link graph containing 80 million target URLs and 1.2 billion hyperlink vectors. The experimental findings indicate that BHC cuts inter-node message routing overhead by 43.6% and speeds up structural index creation by a factor of 3.2 relative to classical hash-based URL allocation approaches. Storage capacity variance stayed below 1.8%, validating data allocation stability.

Keywords: Web Crawling, Graph Partitioning, Distributed Systems, Hyperlink Analysis, Storage Scaling, Index Optimization.

Manuscript Timeline: Received: May 10, 2000; Revised: June 15, 2000; Accepted: July 09, 2000; Published: August 24, 2000.

Citation: Jenkins, S., & Rao, V. (2000). A Balanced Topological Graph Partitioning Scheme for Distributed Web-Scraping Engines. International Journal of Computer Science and Technology, 2(8), 57–64.

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

DOI: 10.46882/2000/IJCST/000019

Research Article

Title: An Optimized Spatial Domain Watermarking Framework for Digital Image Copyright Protection

Names of Authors: Carlos Mendez¹, Elena Rostova²

Authors’ Affiliations: ¹Department of Telecommunications, Polytechnic University of Madrid, Spain; ²Department of Computer Science, Saint Petersburg State University, Russia.

Abstract:
The widespread dissemination of multimedia content over public web servers increases the risk of intellectual property theft and unauthorized digital duplication. Digital watermarking techniques must embed robust ownership signatures into asset files without degrading their perceived visual fidelity. This paper introduces an optimized spatial-domain image watermarking framework that dynamically hides cryptographic verification strings within host images. The system evaluates localized luminance and texture variance indices to discover optimal pixel positions that balance visibility thresholds with data survival parameters. We evaluated the resilience of our watermarking algorithm across a test collection of 5,000 high-resolution images exposed to aggressive compression, filtering, and cropping attacks. The empirical results show that the hidden verification data achieves a 95.8% recovery accuracy after standard JPEG compression down to a 30% quality factor, while preserving a Peak Signal-to-Noise Ratio (PSNR) value above 42.1 decibels. This performance represents a significant advancement in survivability compared to conventional bit-plane modification methods, offering media publishers a secure mechanism for automated asset tracing.

Keywords: Digital Watermarking, Copyright Protection, Image Processing, Information Hiding, Structural Security, Image Fidelity.

Manuscript Timeline: Received: April 01, 2000; Revised: May 12, 2000; Accepted: June 05, 2000; Published: July 22, 2000.

Citation: Mendez, C., & Rostova, E. (2000). An Optimized Spatial Domain Watermarking Framework for Digital Image Copyright Protection. International Journal of Computer Science and Technology, 2(7), 49–56.

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

DOI: 10.46882/2000/IJCST/000018

Research Article

Title: A Scalable Multi-Processor Cache Coherence Protocol for Shared-Memory Architectures

Names of Authors: Arthur Pendelton¹, Yuki Sato²

Authors’ Affiliations: ¹Department of Computer Architecture, University of Texas at Austin, USA; ²Graduate School of Engineering, Osaka University, Osaka, Japan.

Abstract:
Modern multi-processor systems face critical scalability and latency barriers when maintaining memory consistency across highly parallel compute environments. Standard directory-based cache coherence protocols induce extreme network message overheads and memory lookup bottlenecks as core counts expand. This paper develops an optimized, multi-level directory cache coherence protocol designed specifically for high-density, shared-memory processing arrays. The proposed protocol partitions directory records into localized clusters and uses a predictive sharing filter to restrict speculative coherence messages across the global interconnect bus. We evaluated our architectural engine using a cycle-accurate hardware simulator configured with up to 64 parallel processing cores executing diverse computational kernels. The experimental results show a 28.5% reduction in total cache-coherence message traffic and a 16.4% improvement in application execution speed relative to traditional MESI and MOESI baseline setups. The directory tracking memory footprint was lowered by 22.3%, ensuring that hardware scalability constraints are handled without imposing massive silicon area overheads within next-generation symmetric multiprocessing chips.

Keywords: Cache Coherence, Shared Memory, Parallel Architectures, Hardware Simulator, Multiprocessor Systems, Scalable Memory.

Manuscript Timeline: Received: March 02, 2000; Revised: April 08, 2000; Accepted: May 02, 2000; Published: June 18, 2000.

Citation: Pendelton, A., & Sato, Y. (2000). A Scalable Multi-Processor Cache Coherence Protocol for Shared-Memory Architectures. International Journal of Computer Science and Technology, 2(6), 41–48.

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

DOI: 10.46882/2000/IJCST/000017

Research Article

Title: A Heuristic Distributed Clustering Protocol for Maximizing Wireless Sensor Network Lifespan

Names of Authors: Hans-Dieter Schmidt¹, Li Wei-Dong²

Authors’ Affiliations: ¹Institute of Network Computing, University of Stuttgart, Germany; ²Department of Electronic Engineering, National Tsing Hua University, Hsinchu, Taiwan.

Abstract:
Wireless Sensor Networks (WSNs) deployed in extreme environments require autonomous communication architectures that optimize power usage across thousands of battery-dependent micro-sensors. Centralized base-station data collection drains the energy reservoirs of near-station nodes quickly, breaking down network connectivity prematurely. This paper presents an optimized, decentralized clustering protocol, Heuristic Energy-Balanced Clustering (HEBC), that organizes sensor points into distinct operational groups dynamically. The algorithm selects local cluster heads by computing a relative cost vector balancing residual node battery level, proximity to neighbors, and geometric distance from the primary transmission sink. We evaluated our routing protocol across a simulated network monitoring 1,000 spatial sensor nodes under variable transmission stress. The empirical metrics demonstrate that HEBC extends the total network operational lifespan by 34.2% and enhances cumulative data packet transmission volume by 21.8% compared to traditional LEACH and threshold-optimized protocols. The energy consumption variance across the deployment field dropped significantly, proving that HEBC successfully spreads the computational and routing loads uniformly across the sensor fabric.

Keywords: Wireless Sensor Networks, Clustering Protocols, Energy Efficiency, Network Lifespan, Distributed Routing, Load Balancing.

Manuscript Timeline: Received: February 14, 2000; Revised: March 22, 2000; Accepted: April 12, 2000; Published: May 26, 2000.

Citation: Schmidt, H. D., & Wei-Dong, L. (2000). A Heuristic Distributed Clustering Protocol for Maximizing Wireless Sensor Network Lifespan. International Journal of Computer Science and Technology, 2(5), 33–40.

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

DOI: 10.46882/2000/IJCST/000016

Research Article

Title: An Object-Oriented Database Schema Transformation Model for Heterogeneous Data Migration

Names of Authors: Robert K. Jones¹, Amara Okafor²

Authors’ Affiliations: ¹Department of Software Engineering, Australian National University, Canberra, Australia; ²Department of Computer Science, University of Ibadan, Ibadan, Nigeria.

Abstract:
Enterprise computing centers face significant interoperability and data-loss challenges when migrating legacy legacy records into modern object-oriented database management architectures. Structural differences between traditional tabular records and hierarchical object classes often cause runtime exceptions, broken relational linkages, and slow querying speeds. This paper introduces a formal, automated schema transformation model designed to map entity-relationship structures into optimized object-oriented formats smoothly. The framework uses a structural dependency mapping engine that evaluates table constraints, foreign key mappings, and cardinality indices before constructing equivalent class inheritance trees. We tested the execution efficiency of our migration engine by transferring an enterprise resource planning database containing 50 million records and 400 interconnected tables. The system completed the complete structural transformation process without requiring human repair scripts, achieving 100% data integrity preservation. Post-migration query benchmarks show a 31.4% improvement in complex data retrieval operations, validating that our object nesting logic successfully avoids high-overhead join statements in production environments.

Keywords: Database Migration, Schema Transformation, Object-Oriented Databases, Data Integrity, Relational Mapping, Enterprise Software.

Manuscript Timeline: Received: January 08, 2000; Revised: February 18, 2000; Accepted: March 11, 2000; Published: April 22, 2000.

Citation: Jones, R. K., & Okafor, A. (2000). An Object-Oriented Database Schema Transformation Model for Heterogeneous Data Migration. International Journal of Computer Science and Technology, 2(4), 25–32.

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

DOI: 10.46882/2000/IJCST/000015

Research Article

Title: Dynamic Buffer Management for Enhancing Quality of Service in Packet-Switched Networks

Names of Authors: Marcus Vance¹, Nadia Al-Suwaidi²

Authors’ Affiliations: ¹School of Computer Science, McGill University, Montreal, Canada; ²Department of Computer Engineering, United Arab Emirates University, Al Ain, UAE.

Abstract:
Packet-switched communication routers encounter massive packet drop rates and elevated queuing delays during heavy network traffic bursts, severely degrading the Quality of Service (QoS) for real-time media streams. Static buffer allocation policies either fail to capture sudden transmission surges or cause excessive packet delays due to bloated queue architectures. This paper introduces an optimized, dynamic buffer management algorithm that automatically calibrates queue thresholds based on real-time packet arrival rates and port utilization metrics. The framework applies a mathematical threshold adjustments scheme that penalizes non-responsive flows while prioritizing time-critical multimedia packets. We simulated our dynamic buffer configuration using a multi-node network simulator operating under a heavy mix of TCP and UDP data packets. The experimental outcomes indicate a 26.3% reduction in overall packet drop rates and a 38-millisecond improvement in average end-to-end queuing latency compared to standard Random Early Detection and Drop-Tail routing approaches. The system maintains uniform channel utilization across heavily congested backbone switches without inducing packet reordering anomalies, proving its efficacy for high-speed network infrastructures.

Keywords: Buffer Management, Quality of Service, Network Congestion, Packet Switching, Queue Optimization, Router Performance.

Manuscript Timeline: Received: December 01, 1999; Revised: January 10, 2000; Accepted: February 02, 2000; Published: March 15, 2000.

Citation: Vance, M., & Al-Suwaidi, N. (2000). Dynamic Buffer Management for Enhancing Quality of Service in Packet-Switched Networks. International Journal of Computer Science and Technology, 2(3), 17–24.