International Journal of Computer Science and Technology

International Journal of Computer Science and Technology Vol. 3, No. 9, September 2001 | pp. 65–72

DOI: 10.46882/2001/IJCST/000033

Research Article

Title: A Decentralized Validation Ledger for Cross-Domain Identity Management

Names of Authors: Luca Rossi¹, Fatima Al-Suwaidi²

Authors’ Affiliations: ¹Department of Computer Engineering, University of Pisa, Italy; ²Department of Software Engineering, United Arab Emirates University, Al Ain, UAE.

Keywords: Public-Key Infrastructure, Key Management, Cryptographic Protocols, Decentralized Architecture, System Security, Network Trust.

Manuscript Timeline: Received: May 11, 2001; Revised: June 20, 2001; Accepted: July 12, 2001; Published: September 26, 2001.

Citation: Rossi, L., & Al-Suwaidi, F. (2001). A Decentralized Validation Ledger for Cross-Domain Identity Management. International Journal of Computer Science and Technology, 3(9), 65–72.

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

DOI: 10.46882/2001/IJCST/000032

Research Article

Title: A Dense Embedding Alignment Model for Resolving E-Commerce Catalog Sparsity

Names of Authors: Michael Brown¹, Sun-Woo Kim²

Authors’ Affiliations: ¹School of Computer Science, University of Manchester, UK; ²Department of Computer Engineering, Seoul National University, South Korea.

Abstract:
Digital commerce platforms depend heavily on information filtering layers to connect active buyers with relevant product listings. Standard correlation algorithms often fail when encountering severe cold-start parameters or limited historical transaction databases. This paper presents a novel hybrid prediction architecture that integrates user metadata descriptors with explicit rating vectors through an interconnected matrix layer. The model uses dense matrix embeddings to convert sparse categorical variables into a shared lower-dimensional operational layer, identifying complex connections between buyer behavior and catalog features. The hybrid model was tested using a public benchmark dataset containing 10 million data points. The outcomes show an overall Root Mean Squared Error (RMSE) reduction of 6.8% compared to baseline collaborative models, along with a 12.4% precision improvement for newly added catalog entries. The architecture displays strong resilience against data scarcity, maintaining accurate matches even when user profiles contain fewer than five history entries. This research proves that combining user profiles with item attributes resolves systemic data sparsity limitations.

Keywords: Recommender Paradigms, Collaborative Filtering, Matrix Factorization, Data Sparsity, Information Extraction, Retrieval Engines.

Manuscript Timeline: Received: April 02, 2001; Revised: May 15, 2001; Accepted: June 08, 2001; Published: August 20, 2001.

Citation: Brown, M., & Kim, S. W. (2001). A Dense Embedding Alignment Model for Resolving E-Commerce Catalog Sparsity. International Journal of Computer Science and Technology, 3(8), 57–64.

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

DOI: 10.46882/2001/IJCST/000031

Research Article

Title: A Multi-Tiered Predictive Allocation Model for Enhancing Enterprise Storage Arrays

Names of Authors: Arjun Nair¹, Sophie Dubois²

Authors’ Affiliations: ¹Department of Information Technology, Indian Institute of Technology, Madras, India; ²Laboratoire d'Informatique, Sorbonne University, Paris, France.

Abstract:
Enterprise database centers experience significant input-output bottlenecks due to fragmented hardware layouts and unoptimized workload distributions. Leaving storage resources idling leads to unnecessary energy expenditures and inefficient hardware lifecycles. This paper details a modified Best-Fit Decreasing heuristic model developed to handle multi-dimensional storage limits, balancing Central Processing Unit (CPU), Random Access Memory (RAM), and storage block capabilities simultaneously. The consolidation framework analyzes historical data access trends to prevent aggressive workload migrations that trigger unexpected performance latency bottlenecks. We evaluated the algorithmic framework against infrastructure traces monitoring 800 physical server nodes over a 30-day trial period. The performance analytics show that our heuristic saves 22.8% more power than static allocation models, while diminishing standard operational performance violations by 14.5%. The overall workload relocation overhead was restricted to 3.2% of cluster capability, proving that computing infrastructure can be optimized safely without introducing system latency or compromising active production application routines.

Keywords: Resource Allocation, Optimization Heuristics, Storage Management, Load Balancing, Enterprise Architecture, Computing Efficiency.

Manuscript Timeline: Received: March 05, 2001; Revised: April 12, 2001; Accepted: May 02, 2001; Published: July 15, 2001.

Citation: Nair, A., & Dubois, S. (2001). A Multi-Tiered Predictive Allocation Model for Enhancing Enterprise Storage Arrays. International Journal of Computer Science and Technology, 3(7), 49–56.

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

DOI: 10.46882/2001/IJCST/000030

Research Article

Title: An Automated Clustering Pipeline for Document Clustering over Distributed Web Proxies

Names of Authors: Robert Evans¹, Yuki Tanaka²

Authors’ Affiliations: ¹Department of Software Engineering, University of Toronto, Canada; ²Graduate School of Information Science, Tokyo Institute of Technology, Japan.

Abstract:
The growth of textual data distributed across remote network caching proxies requires scalable clustering frameworks capable of grouping documents without high data relocation overheads. Executing text analysis over distributed nodes requires resilient ingestion architectures and fast categorization engines. This paper presents an integrated text clustering pipeline utilizing decentralized text preprocessing modules and an optimized k-means partitioning algorithm. The pipeline groups text elements across multi-node clusters, handling up to 15,000 files per second. We verified the architecture using a dataset of 5 million web records across a distributed proxy network. The processing pipeline achieved a classification accuracy of 89.4% while maintaining sub-second text categorization latency from ingestion to database storage. We introduced a customized token filtering module that handles syntax variations, increasing clustering purity metrics by 7.3%. Comparative benchmarks confirm that our distributed architecture outperforms traditional centralized storage workflows by a factor of 12, offering enterprises an efficient tool for distributed document management.

Keywords: Distributed Computing, Document Clustering, Ingestion Pipelines, Cluster Analysis, Performance Optimization, Text Mining.

Manuscript Timeline: Received: March 18, 2001; Revised: April 29, 2001; Accepted: May 15, 2001; Published: June 25, 2001.

Citation: Evans, R., & Tanaka, Y. (2001). An Automated Clustering Pipeline for Document Clustering over Distributed Web Proxies. International Journal of Computer Science and Technology, 3(6), 41–48.

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

DOI: 10.46882/2001/IJCST/000029

Research Article

Title: An Optimized Rijndael Core Implementation for High-Throughput Network Interface Cards

Names of Authors: Klaus Werner¹, Chen Wei²

Authors’ Affiliations: ¹Institute of Cyber Security, Technical University of Munich, Germany; ²School of Computer Science, Tsinghua University, Beijing, China.

Abstract:
High-speed network links require line-rate cryptographic processing to protect sensitive enterprise data packets without inducing severe system performance bottlenecks. Directly processing standard block ciphers via software layers introduces extreme packet latency and oversaturates system CPU cycles. This paper proposes a hardware-optimized, fully pipelined implementation of the Rijndael encryption standard designed for network interface hardware architectures. By restructuring the internal substitution-box transformations and consolidating matrix multiplications into an iterative lookup design, the cryptographic core reduces processing delays and gate counts. The proposed design was integrated into a programmable logic board to measure throughput speeds and chip resource utilization profiles. The empirical metrics indicate a 32.4% reduction in silicon gate usage and a 15.8% acceleration in cryptographic processing throughput relative to conventional baseline implementations. Security evaluation confirms that the core maintains robust protection against timing-analysis and power-analysis exploits while successfully meeting the line-rate constraints demanded by modern network routing matrices.

Keywords: Network Security, Cryptographic Hardware, Advanced Encryption Standard, Pipelined Architectures, Throughput Optimization, Logic Design.

Manuscript Timeline: Received: February 05, 2001; Revised: March 14, 2001; Accepted: April 08, 2001; Published: May 18, 2001.

Citation: Werner, K., & Wei, C. (2001). An Optimized Rijndael Core Implementation for High-Throughput Network Interface Cards. International Journal of Computer Science and Technology, 3(5), 33–40.

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

DOI: 10.46882/2001/IJCST/000028

Research Article

Title: A Scalable Spatial Index Model for Multi-Dimensional Geographic Databases

Names of Authors: John A. Smith¹, Mariam O. Alabi²

Authors’ Affiliations: ¹Department of Computer Science, University of California, Berkeley, USA; ²Department of Information Technology, Federal University of Technology, Minna, Nigeria.

Abstract:
Geographic Information Systems (GIS) require efficient multidimensional database indexing structures to execute complex spatial overlap and proximity queries quickly. Standard bounding-box index methods experience extreme leaf overlap bottlenecks as spatial object densities expand, causing severe query processing latencies. This paper introduces an optimized multi-dimensional indexing model, Balanced Cell-Split (BCS), designed for high-density spatial layouts. The proposed framework divides complex geographical vectors into dynamic, non-overlapping hierarchical cells using a localized coordinate quadrant matching scheme. We evaluated query execution speeds across an experimental database containing 50 million unique geographic polygons under varying query densities. Experimental results demonstrate a reduction in average query retrieval latency by 24.5% and an increase in overall indexing resource efficiency by 18.2% compared to traditional R-tree and quad-tree indexing structures. The storage footprint required for index paths dropped linearly with dataset scaling, establishing a reliable database template for modern spatial mapping technologies.

Keywords: Spatial Databases, Geographic Information Systems, Index Optimization, Multi-Dimensional Data, Query Latency, Data Structures.

Manuscript Timeline: Received: January 10, 2001; Revised: February 22, 2001; Accepted: March 12, 2001; Published: April 22, 2001.

Citation: Smith, J. A., & Alabi, O. M. (2001). A Scalable Spatial Index Model for Multi-Dimensional Geographic Databases. International Journal of Computer Science and Technology, 3(4), 25–32.