Selected work

Representative Papers

A Semantic-Web Oriented Competency Model for Engineering Programs

May 19, 2026

This study addresses the gap between existing Bodies of Knowledge (BoKs) in computing and their effective translation into assessable, competency-oriented curricula. The authors propose an innovative competency-mapping methodology that systematically aligns BoKs with a structured competency framework, resulting in a five-year engineering curriculum encompassing 23 core competencies, organized into five thematic modules and three specialization tracks, and integrating mandatory work-integrated learning projects. To support explicit linkage, collaborative maintenance, and continuous evolution of knowledge-to-competency mappings, the authors developed ISANUMpedia—a semantic web–based collaborative platform. Implemented in the ISANUM engineering degree program, this approach successfully mapped 494 knowledge topics to the 23 competencies, significantly enhancing the curriculum’s professional relevance and assessability.

0 citationsRead paper

The empirical discrete copula process

Jun 14, 2025

This paper addresses the lack of a rigorous statistical inference framework for modeling discrete joint distributions. We propose the first general-purpose inference method for discrete copulas—applicable to arbitrary dimensions and finite supports—by defining the discrete copula as the I-projection (KL-divergence minimizer) of the empirical frequency array onto the uniform-marginal constraint polytope. Theoretically, we establish strong consistency and √n-asymptotic normality of this estimator for the first time, derive an explicit “sandwich” covariance structure, and uncover a deep connection to entropy-regularized optimal transport. Methodologically, we leverage this framework to derive the asymptotic distribution of Yule’s coefficient of colligation and construct a test for quasi-independence in multivariate contingency tables. Our work provides both a rigorous statistical foundation and practical inferential tools for discrete copula modeling.

0 citationsRead paper

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List

Jan 17, 2025

This paper addresses the space overhead inherent in generating all permutations of an $n$-element set. We propose an iterative in-place algorithm based on linked-list rearrangement, requiring only two constant-time operations—“swap the first two elements” and “move the tail element to the head”—to generate all $n!$ permutations without node creation or dynamic memory allocation. The algorithm employs recursive-style list manipulations and is implemented and verified for correctness and completeness in Lisp. Although it does not produce permutations in lexicographic order, each step incurs $O(1)$ computational cost, yielding an overall time complexity of $O(n! cdot n)$ and a space complexity of $O(n)$ (exclusively due to the recursion stack). To our knowledge, this is the first algorithm achieving truly in-place generation of all permutations—without auxiliary storage or node construction—thereby significantly reducing cache misses and memory pressure.

0 citationsRead paper

Recent publications

Latest Papers

A Semantic-Web Oriented Competency Model for Engineering Programs

May 19, 2026

This study addresses the gap between existing Bodies of Knowledge (BoKs) in computing and their effective translation into assessable, competency-oriented curricula. The authors propose an innovative competency-mapping methodology that systematically aligns BoKs with a structured competency framework, resulting in a five-year engineering curriculum encompassing 23 core competencies, organized into five thematic modules and three specialization tracks, and integrating mandatory work-integrated learning projects. To support explicit linkage, collaborative maintenance, and continuous evolution of knowledge-to-competency mappings, the authors developed ISANUMpedia—a semantic web–based collaborative platform. Implemented in the ISANUM engineering degree program, this approach successfully mapped 494 knowledge topics to the 23 competencies, significantly enhancing the curriculum’s professional relevance and assessability.

0 citationsRead paper

The empirical discrete copula process

Jun 14, 2025

This paper addresses the lack of a rigorous statistical inference framework for modeling discrete joint distributions. We propose the first general-purpose inference method for discrete copulas—applicable to arbitrary dimensions and finite supports—by defining the discrete copula as the I-projection (KL-divergence minimizer) of the empirical frequency array onto the uniform-marginal constraint polytope. Theoretically, we establish strong consistency and √n-asymptotic normality of this estimator for the first time, derive an explicit “sandwich” covariance structure, and uncover a deep connection to entropy-regularized optimal transport. Methodologically, we leverage this framework to derive the asymptotic distribution of Yule’s coefficient of colligation and construct a test for quasi-independence in multivariate contingency tables. Our work provides both a rigorous statistical foundation and practical inferential tools for discrete copula modeling.

0 citationsRead paper

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List

Jan 17, 2025

This paper addresses the space overhead inherent in generating all permutations of an $n$-element set. We propose an iterative in-place algorithm based on linked-list rearrangement, requiring only two constant-time operations—“swap the first two elements” and “move the tail element to the head”—to generate all $n!$ permutations without node creation or dynamic memory allocation. The algorithm employs recursive-style list manipulations and is implemented and verified for correctness and completeness in Lisp. Although it does not produce permutations in lexicographic order, each step incurs $O(1)$ computational cost, yielding an overall time complexity of $O(n! cdot n)$ and a space complexity of $O(n)$ (exclusively due to the recursion stack). To our knowledge, this is the first algorithm achieving truly in-place generation of all permutations—without auxiliary storage or node construction—thereby significantly reducing cache misses and memory pressure.

0 citationsRead paper