ACM Computing Classification Research Articles

Software Engineering Education Knowledge Versus Industrial Needs

Contribution: Determine and analyze the gap between software practitioners' education outlined in the 2014IEEE/ACM Software Engineering Education Knowledge (SEEK) and industrial needs pointed by Wikipedia articles referenced in Stack Overflow (SO) posts. Background: Previous work has uncovered deficiencies in the coverage of computer fundamentals, people skills, software processes, and human-computer interaction, suggesting rebalancing. Research Questions: 1) To what extent are developers' needs, in terms of Wikipedia articles referenced in SO posts, covered by the SEEK knowledge units? 2) How does the popularity of Wikipedia articles relate to their SEEK coverage? 3) What areas of computing knowledge can be better covered by the SEEK knowledge units? 4) Why are Wikipedia articles covered by the SEEK knowledge units cited on SO? Methodology: Wikipedia articles were systematically collected from SO posts. The most cited were manually mapped to the SEEK knowledge units, assessed according to their degree of coverage. Articles insufficiently covered by the SEEK were classified by hand using the 2012 ACM Computing Classification System. A sample of posts referencing sufficiently covered articles was manually analyzed. A survey was conducted on software practitioners to validate the study findings. Findings: SEEK appears to cover sufficiently computer science fundamentals, software design and mathematical concepts, but less so areas like the World Wide Web, software engineering components, and computer graphics. Developers seek advice, best practices and explanations about software topics, and code review assistance. Future SEEK models and the computing education could dive deeper in information systems, design, testing, security, and soft skills.

Twenty-five Years of Journal of Universal Computer Science: A Bibliometric Overview

The Journal of Universal Computer Science is a monthly peer-reviewed open-access scientific journal covering all aspects of computer science, launched in 1994, so becoming twenty-five years old in 2019. In order to celebrate its anniversary, this study presents a bibliometric overview of the leading publication and citation trends occurring in the journal. The aim of the work is to identify the most relevant authors, institutions, countries, and analyze their evolution through time. The article uses the Web of Science Core Collection citations and the ACM Computing Classification System in order to search for the bibliographic information. Our study also develops a graphical mapping of the bibliometric material by using the visualization of similarities (VOS) viewer. With this software, the work analyzes bibliographic coupling, citation and co-citation analysis, co-authorship, and co-occurrence of keywords. The results underline the significant growth of the journal through time and its international diversity having publications from countries all over the world and covering a wide range of categories which confirms the “universal” character of the journal.

Knowledge base enrichment by relation learning from social tagging data

There has been considerable interest in transforming unstructured social tagging data into structured knowledge for semantic-based retrieval and recommendation. Research in this line mostly exploits data co-occurrence and often overlooks the complex and ambiguous meanings of tags. Furthermore, there have been few comprehensive evaluation studies regarding the quality of the discovered knowledge. We propose a supervised learning method to discover subsumption relations from tags. The key to this method is quantifying the probabilistic association among tags to better characterise their relations. We further develop an algorithm to organise tags into hierarchies based on the learned relations. Experiments were conducted using a large, publicly available dataset, Bibsonomy, and three popular, human-engineered or data-driven knowledge bases: DBpedia, Microsoft Concept Graph, and ACM Computing Classification System. We performed a comprehensive evaluation using different strategies: relation-level, ontology-level, and knowledge base enrichment based evaluation. The results clearly show that the proposed method can extract knowledge of better quality than the existing methods against the gold standard knowledge bases. The proposed approach can also enrich knowledge bases with new subsumption relations, having the potential to significantly reduce time and human effort for knowledge base maintenance and ontology evolution.

Subresultant Polynomial Remainder Sequences Obtained by Polynomial Divisions in Q[x] or in Z[x

In this paper we present two new methods for computing thesubresultant polynomial remainder sequence (prs) of two polynomials f, g ∈ Z[x]. We are now able to also correctly compute the Euclidean and modifiedEuclidean prs of f, g by using either of the functions employed by ourmethods to compute the remainder polynomials.Another innovation is that we are able to obtain subresultant prs’s inZ[x] by employing the function rem(f, g, x) to compute the remainderpolynomials in [x]. This is achieved by our method subresultants_amv_q(f, g, x), which is somewhat slow due to the inherent higher cost of com-putations in the field of rationals.To improve in speed, our second method, subresultants_amv(f, g,x), computes the remainder polynomials in the ring Z[x] by employing thefunction rem_z(f, g, x); the time complexity and performance of thismethod are very competitive.Our methods are two different implementations of Theorem 1 (Section 3),which establishes a one-to-one correspondence between the Euclidean andmodified Euclidean prs of f, g, on one hand, and the subresultant prs of f, g,on the other.By contrast, if – as is currently the practice – the remainder polynomi-als are obtained by the pseudo-remainders function prem(f, g, x) 3 , thenonly subresultant prs’s are correctly computed. Euclidean and modified Eu-clidean prs’s generated by this function may cause confusion with the signsand conflict with Theorem 1.ACM Computing Classification System (1998): F.2.1, G.1.5, I.1.2.

Representing Equivalence Problems for Combinatorial Objects

Methods for representing equivalence problems of various combinatorial objectsas graphs or binary matrices are considered. Such representations can be used for isomorphism testing in classification or generation algorithms. Often it is easier to consider a graph or a binary matrix isomorphism problem than to implement heavy algorithms depending especially on particular combinatorialobjects. Moreover, there already exist well tested algorithms for the graph isomorphismproblem (nauty) and the binary matrix isomorphism problem as well (Q-Extension).ACM Computing Classification System (1998): F.2.1, G.4.

Five Turning Points in the Historical Progress of Statistics - My Personal Vision

Statistics has penetrated almost all branches of science and allareas of human endeavor. At the same time, statistics is not only misunderstood, misused and abused to a frightening extent, but it is also oftenmuch disliked by students in colleges and universities. This lecture discusses/covers/addresses the historical development of statistics, aiming at identifying the most important turning points that led to the present stateof statistics and at answering the questions “What went wrong with statistics?” and “What to do next?”.ACM Computing Classification System (1998): A.0, A.m, G.3, K.3.2.

Remarks on the Balaban Index

In this paper we compute some bounds of the Balaban index and then by means of group action we compute the Balaban index of vertex transitive graphs. ACM Computing Classification System (1998): G.2.2 , F.2.2.

Approximate Model Checking of Real-Time Systems for Linear Duration Invariants

Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented. In this paper, we present an approximate model checking technique based on a genetic algorithm to check real-time automata for linear durration invariants in reasonable times. Genetic algorithm is a good optimization method when a problem needs massive computation and it works particularly well in our case because the fitness function which is derived from the linear duration invariant is linear. ACM Computing Classification System (1998): D.2.4, C.3.

Construction of Optimal Linear Codes by Geometric Puncturing

Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to construct new codes. ACM Computing Classification System (1998): E.4.

An Open Virtual World for Professional Development

The paper presents a study that focuses on the issue of sup-porting educational experts to choose the right combination of educational methodology and technology tools when designing training and learning programs. It is based on research in the field of adaptive intelligent e-learning systems. The object of study is the professional growth of teachers in technology and in particular that part of their qualification which is achieved by organizing targeted training of teachers. The article presents the process of creating and testing a system to support the decision on the design of training for teachers, leading to more effective implementation of technology in education and integration in diverse educational contexts. ACM Computing Classification System (1998): H.4.2, I.2.1, I.2, I.2.4, F.4.1.

Orthogonal Resolutions and Latin Squares

Resolutions which are orthogonal to at least one other resolution (RORs) and sets of m mutually orthogonal resolutions (m-MORs) of 2-(v, k, λ) designs are considered. A dependence of the number of nonisomorphic RORs and m-MORs of multiple designs on the number of inequivalent sets of v/k − 1 mutually orthogonal latin squares (MOLS) of size m is obtained. ACM Computing Classification System (1998): G.2.1.

Finite Symmetric Functions with Non-Trivial Arity Gap

Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)). We prove several results concerning decomposition of the symmetric functions with non-trivial arity gap with its minors or subfunctions. We show that all non-empty sets of essential variables in symmetric functions with non-trivial arity gap are separable. ACM Computing Classification System (1998): G.2.0.

A Bimodality Test in High Dimensions

We present a test for identifying clusters in high dimensional data based on the k-means algorithm when the null hypothesis is spherical normal. We show that projection techniques used for evaluating validity of clusters may be misleading for such data. In particular, we demonstrate that increasingly well-separated clusters are identified as the dimensionality increases, when no such clusters exist. Furthermore, in a case of true bimodality, increasing the dimensionality makes identifying the correct clusters more difficult. In addition to the original conservative test, we propose a practical test with the same asymptotic behavior that performs well for a moderate number of points and moderate dimensionality. ACM Computing Classification System (1998): I.5.3.

Noun Sense Disambiguation using Co-Occurrence Relation in Machine Translation

Word Sense Disambiguation, the process of identifying the meaning of a word in a sentence when the word has multiple meanings, is a critical problem of machine translation. It is generally very difficult to select the correct meaning of a word in a sentence, especially when the syntactical difference between the source and target language is big, e.g., English-Korean machine translation. To achieve a high level of accuracy of noun sense selection in machine translation, we introduced a statistical method based on co-occurrence relation of words in sentences and applied it to the English-Korean machine translator RyongNamSan. ACM Computing Classification System (1998): I.2.7.

A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem

This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational results show that the proposed VNS achieves all optimal or best known solutions in short times. The experiments indicate that the VNS compares favorably with other methods previously used for solving the MSSP. ACM Computing Classification System (1998): I.2.8.

A Mixed Integer Quadratic Programming Model for the Low Autocorrelation Binary Sequence Problem

In this paper the low autocorrelation binary sequence problem (LABSP) is modeled as a mixed integer quadratic programming (MIQP) problem and proof of the model’s validity is given. Since the MIQP model is semidefinite, general optimization solvers can be used, and converge in a finite number of iterations. The experimental results show that IQP solvers, based on this MIQP formulation, are capable of optimally solving general/skew-symmetric LABSP instances of up to 30/51 elements in a moderate time. ACM Computing Classification System (1998): G.1.6, I.2.8.

Major update to ACM's Computing Classification System

No abstract available.

Learning-based concept-hierarchy refinement through exploiting topology, content and social information

Concept hierarchies, such as the ACM Computing Classification Scheme and InterPro Protein Sequence Classification, are widely used in categorization and indexing applications. In the Internet and Web 2.0 era, new concepts and terms are emerging on an almost daily basis, so it is essential that such hierarchies maintain up-to-date records of concepts. This paper proposes a mechanism to identify the most suitable position to insert new terms into an existing concept hierarchy. The problem is challenging because there are hundreds or even thousands of candidate positions for insertion. Furthermore, usually there is no training instance available for an insertion; nor is it practical to assume the availability of a detailed description of the target concept, except in the hierarchy itself. To resolve the problem, we exploit the topology, content and social information, and apply a learning approach to identify the underlying construction criteria of the concept hierarchy. We utilize three metrics (namely, accuracy, taxonomic closeness, and ranking) to evaluate the proposed learning-based approach on the ACM CCS, the DOAJ and the InterPro datasets to evaluate the proposed learning-based approach. The results demonstrate that, in all three metrics, our approach outperforms similarity-based approaches, such as the Normalized Google Distance, by a significant margin. Finally, we propose a level-based recommendation scheme as a novel application of our system. The source code, dataset, and other related resources are available at http://www.csie.ntu.edu.tw/~d97944007/refinement/.

The Research Foci of Computing Research in South Africa as Reflected by Publications in the South African Computer Journal

The South African Computer Journal, better known as SACJ, has, for the last nineteen years, been one of the most pertinent
 publications for the computing discipline within the South African milieu. In this paper we reflect on the topics of research
 articles published in SACJ over its first 40 volumes of the journal using the ACM Computing Classification Scheme as basis. In
 our analysis we divided the publications into three cycles of more or less six years in order to identify significant trends over the
 history of the journal. We also used the same classification scheme to analyse the publication trends of various South African
 tertiary education and research institutions.

Integration of distributed terminology resources to facilitate subject cross‐browsing for library portal systems

PurposeThe paper aims to develop a prototype middleware framework between different terminology resources in order to provide a subject cross‐browsing service for library portal systems.Design/methodology/approachNine terminology experts were interviewed to collect appropriate knowledge to support the development of a theoretical framework for the research. Based on this, a simplified software‐based prototype system was constructed incorporating the knowledge acquired. The prototype involved mappings between the computer science schedule of the Dewey Decimal Classification (which acted as a spine) and two controlled vocabularies, UKAT and ACM Computing Classification. Subsequently, six further experts in the field were invited to evaluate the prototype system and provide feedback to improve the framework.FindingsThe major findings showed that, given the large variety of terminology resources distributed throughout the web, the proposed middleware service is essential to integrate technically and semantically the different terminology resources in order to facilitate subject cross‐browsing. A set of recommendations are also made, outlining the important approaches and features that support such a cross‐browsing middleware service.Originality/valueCross‐browsing features are lacking in current library portal meta‐search systems. Users are therefore deprived of this valuable retrieval provision. This research investigated the case for such a system and developed a prototype to fill this gap.