Search

The author offers his opinion on the current state of artificial intelligence (AI) and the so-called "AI winter" that happened after the 1980s. He explores the use of neural networks and notes that until recently they would have been grouped with machine learning, deep learning, or big data, rather than AI.

This article discusses the potential for a new epoch of time, the cybercene a time period heavily influenced and dictated by computing. This article focuses on the relationship between humans and computing, described here as the computing complex, and what needs to be done to prevent the cybercene. Topics include the impact computing has on energy use and democracy and the role computing professionals and organizations need to play to prevent the cybercene.

This article provides an overview of the scientific awards given by the Association of Computing Machinery (ACM) and the nomination process with the goal of encouraging diverse nominees. The article points out the diversity discrepancy in ACM membership compared to award winners as well as impact on future computing professionals when awards are given to diverse individuals. Topics include the role of special interest groups, a description of each of the ACM awards, as well as tips on how to submit an effective nomination.

This article discusses limitations of the current analysis methods for improving diversity to broaden participation in computing. The article presents a series of visualizations to expose limitations in the current standard analysis which uses computing degree graduation data. The article promotes the use of cohort-based data and intersectional data with an emphasis on university demographic context.

This article explores the topic of biocomputation with living cellular computers by detailing the basic concepts of cellular computer construction as well as exploring improvements. The article includes programming bacteria to perform living Boolean logic functions and developing advanced living models of computation beyond combinatorial logic. Topics include synthetic biology, cellular supremacy, as well as systems complexity and algorithmic complexity.

The gap between high-quality, reputable journals and low-quality "predatory" journals—those aiming to profit without rigorous standards—affects many academics, particularly in developing countries where publishing pressures are intense. The South African Computer Journal (SACJ) has faced challenges associated with this publishing landscape, especially since transitioning to open access in 2010, as the editor sought to bridge this gap through developmental support for authors. During the editor's term from 2012 to 2022, SACJ focused on mentorship, rigorous feedback, and quality measures like inclusion in indexing services to distinguish itself from predatory journals while fostering a supportive publication process for early-career researchers. Lessons from SACJ highlight the importance of mentorship, developmental publishing practices, and strategic quality positioning to enhance the credibility of regionally focused journals in under-resourced academic contexts.

The article discusses an algorithm designed to compute maximum flow and minimum-cost flows. It builds on the works of prior researchers to propose new theorems and provides formulas and graphs to illustrate these theorems and schemes.

The article provides a theoretical analysis of edit distance algorithms. It surveys the varying approaches in analyzing edit distance algorithms. It concludes that the implementation and validation or edit distance algorithms should be part of the same process rather than treated as individual processes. It advocates for a mulit-disciplinary team that can merge the theoretical and practical aspect of this discipline.

The article examines the rise of ubiquitous computing. Describes the proliferation of smart phones, mobile computing devices and immersive technologies that produce "anywhere and everywhere data" and how such devices are becoming increasing entwined. Describes the local, temporal and contextual nature of generated data. Applies the post-cognitive framework from social science to information science in order to describe how information is transformed through interactions between media sources. Discusses how the various devices should complement each other as ubiquitous analytics works to leverage the shared data.

The article discusses the community that developed during the decade of the 1970's that fostered the growth of research into artificial intelligence. It details the slow progress of AI researchers in developing the field. It mentions the importance of military backing in aid of AI research, including funding acquired through Advanced Research Projects Agency (ARPA) to places like MIT and Stanford University. It outlines the continued struggle for broader funding. It describes the growth of AI organizations, increased conference attendance, class enrollment in universities, and the growing number of published articles throughout the 1970's as evidence of the growing support for this field in the academic and computer science communities.

This article reflects on the author’s experiences as a black woman in the field of computing science. Topics include her educational experience in computing science, her personal communities’ support of her throughout her education, and how her experiences lead to her Science Everywhere project which encourages learners to think about STEM in all aspects of their daily lives.

This article investigates the current state of informatics higher education in Europe by utilizing the Informatics Europe Higher Education (IEHE) data portal. First, the article provides a detailed look at the IEHE data portal. Then the article provides a case study comparing informatics higher education at applied sciences universities compared to traditional research universities in five selected European countries using data providing in the portal.

Considering the interconnection of computing and human languages. [ABSTRACT FROM AUTHOR]

First-job readiness versus long-term career preparation. [ABSTRACT FROM AUTHOR]

The article discusses the relationship between artificial intelligence and computer science and the history and development of each discipline between 1950 and 1970. Information is presented on the research behind artificial intelligence and the beginning of graduate education programs in the United States in both artificial intelligence and computer science.

The article explores Propositional Satisfiability (SAT), described by the authors as a cornerstone of computational complexity theory. Particular focus is given to how it has become a central target problem for solving hard computational problems in practice. Other topics discussed include how initial progress was made in SAT solving in the early 1990s and details on other eras of practical SAT solving.

The article focuses on the work of Peter Shor, professor of applied mathematics at Massachusetts Institute of Technology (MIT), on how quantum computers could break current public-key encryption schemes. The author explains how this method utilizes the the quantum implementation of a Fourier transform.

The author writes about the importance of effectively communicating the broad and impactful aspects of computer science, moving beyond technical jargon to engage both educated non-experts and the general public. This involves creating concise "elevator speeches" and utilizing opportunities to bridge the gap in understanding terms like "artificial intelligence" (AI) and "machine learning." He feels that public engagement, such as interacting with journalists, giving interviews, and writing opinion articles, is crucial to demonstrate how computer science can address complex societal issues as well as secure support for the field, and that active participation in public engagement enhances the field's visibility, attracts diverse students, and safeguards its future, particularly in addressing concerns about AI ethics and workforce effects.

The article focuses on how revisiting key algorithms from computing history can unlock the hidden efficiency in computer science problems. The author discusses the shortest-path problem that has been long-standing, explores the use of the Bellman-Ford algorithm, and examines the work of Aaron Bernstein, Danupon Nanongkai, and Christian Wulff-Nilsen.

An introduction to a special section of the journal that focuses upon computer science and technological innovations in Latin America is presented.

The article focuses on the Internet's essential simplicity. The authors discuss the fundamental Internet design choices that have been in place since the 1980s, examines the rationale behind these design choices in an effort to understand the "why, not how" of the Internet, and offers insights for all computer scientists. A "Brief Internet Timeline" is also provided.

The author explores the nature of theoretical computer science (TCS) and its relationship with mathematics, arguing against the view that TCS is merely a subfield of mathematics. Drawing on the historical development of TCS and the impact of computing as a technology, the author emphasizes the importance of looking to physics for inspiration rather than focusing solely on abstract mathematical approaches. The author concludes that while TCS involves mathematical concepts, its primary role should be to explain and predict real-world computing challenges.

The article explores increasing awareness in diversity, equity and inclusion (DEI) in technology fields with a presentation that included an evaluation of attitudes towards DEI at a computer science education conference in India. A brief look at some angles- curriculum, supporting women in the industry, and professional recognition- as well as takeaways from the DEI presentation are included.

Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines. Given a set of points S and a radius parameter r > 0, the r-near neighbor (r-NN) problem asks for a data structure that, given any query point q, returns a point p within distance at most r from q. In this paper, we study the r-NN problem in the light of individual fairness and providing equal opportunities: all points that are within distance r from the query should have the same probability to be returned. The problem is of special interest in high dimensions, where Locality Sensitive Hashing (LSH), the theoretically leading approach to similarity search, does not provide any fairness guarantee. In this work, we show that LSH-based algorithms can be made fair, without a significant loss in efficiency. We propose several efficient data structures for the exact and approximate variants of the fair NN problem. Our approach works more generally for sampling uniformly from a subcollection of sets of a given collection and can be used in a few other applications. We also carried out an experimental evaluation that highlights the inherent unfairness of existing NN data structures. [ABSTRACT FROM AUTHOR]

An interview with Association for Computing Machinery (ACM) fellow Dana Stewart Scott who discusses various topics including his career involving the fields of computing science, automata theory, and the theory of programming languages. Scott's receipt of the ACM's A.M. Turing Award with colleague Michael Rabin in 1976 is mentioned, along with Scott's education, his involvement with mathematical logic, and his work at the University of Chicago and the University of California, Berkeley.

The article discusses hybrid computation systems involving satisfiability (SAT) solving and computer algebra systems (CAS) that combine mathematical algorithms and efficient search and learning processes.

The author discusses the significance of total-system analysis in computer science, particularly trust in total-system analysis and the difficulty in achieving such trust and assurance. It examines artificial intelligence, cryptography, and multilevel security. The article also examines hierarchically layered designs and methods.

The Burrows-Wheeler Transform (BWT) is an invertible text transformation that permutes symbols of a text according to the lexicographical order of its suffixes. BWT is the main component of popular lossless compression programs (such as bzip2) as well as recent powerful compressed indexes (such as the r-index7), central in modern bioinformatics. The compressibility of BWT is quantified by the number r of equal-letter runs in the output. Despite the practical significance of BWT, no nontrivial upper bound on r is known. By contrast, the sizes of nearly all other known compression methods have been shown to be either always within a polylog n factor (where n is the length of the text) from z, the size of Lempel--Ziv (LZ77) parsing of the text, or much larger in the worst case (by an nε factor for ε > 0). In this paper, we show that r = O (z log² n) holds for every text. This result has numerous implications for text indexing and data compression; in particular: (1) it proves that many results related to BWT automatically apply to methods based on LZ77, for example, it is possible to obtain functionality of the suffix tree in O (z polylog n) space; (2) it shows that many text processing tasks can be solved in the optimal time assuming the text is compressible using LZ77 by a sufficiently large polylog n factor; and (3) it implies the first nontrivial relation between the number of runs in the BWT of the text and of its reverse. In addition, we provide an O (z polylog n)-time algorithm converting the LZ77 parsing into the run-length compressed BWT. To achieve this, we develop several new data structures and techniques of independent interest. In particular, we define compressed string synchronizing sets (generalizing the recently introduced powerful technique of string synchronizing sets11) and show how to efficiently construct them. Next, we propose a new variant of wavelet trees for sequences of long strings, establish a nontrivial bound on their size, and describe efficient construction algorithms. Finally, we develop new indexes that can be constructed directly from the LZ77 parsing and efficiently support pattern matching queries on text substrings. [ABSTRACT FROM AUTHOR]

The author discusses computational methods utilized in the peer review process. It examines the availability of data in peer review, and experimentation in peer review design. It also discusses author identity bias, overall subjectivity in peer review, and author incentives.

This article presents the author’s view on the role of computation in future discoveries and developments in all fields. Topics include the energy procurement and application to fuel discoveries, the often never-ending work when an initial goal is completed using the sequencing of the human genome as an example, and the role of computer scientists as figurative boundary hunters.

The article discusses the computer programming language known as Go, which was created at the high technology firm Google in 2007, and open source released in 2009. It examines the decision making processes concerning the design and success of Go, how Go treats language features, and the March 2022 release of Go 1.18.

The article scrutinizes the use of informatics within the European renewable energy industries. The author outlines challenges associated with the proliferation of renewable energy generation which cal allegedly be addressed using informatics such as volatility, uncertainty, and decentralized electric power generation and distribution.

The article discusses the lack of efficiency in how research data within the Computer Science discipline are shared. The author uses the acronym FAIR -- findable, accessible, interoperable, and reusable -- to capture how data should be made available at conferences and in journals.

COMPUTATIONAL THINKING, WHICH centers around devising abstractions for problems so they can be solved with computational steps and efficient algorithms, is a concept that serves not only computer science (CS) but progressively more of science and everyday life. [ABSTRACT FROM AUTHOR]

The article discusses the computer science (CS) and mathematical theorem difficulty known as the polynomial (P) vs. nondeterministic polynomial problem (NP) problem, which was first introduced by computer scientists and mathematician Steve Cook in 1971. According to the article, the solution to the problem remains elusive. The article examines the relationship between the problem and advances in machine learning (ML), how the problem can be utilized to assess CS possibilities, and the potential of reaching artificial general intelligence.

An introduction is provided to the issue's special section on the theme of computational sciences (CS) in India with topics, including the impact of noise within neural networks, data science and artificial intelligence (AI) centers at Indian universities and modeling COVID-19 transmission.

The authors present their thoughts about the significance of computer ethics and the construction and support of ethical computing cultures in an era of rapid technological innovations. The article revisits the "Menlo Report" from 2012, calls for codes of data science ethics, and research governance.

The author argues that the computer science industry should develop a new computer-aided design (CAD) program in order to simplify the development and construction of computer hardware, shorten development time, and institute a new era of design. It examines the use of boundary-representation (B-rep) kernals, the concept of duplication, and version control. The author also examines testing and user design and experience.

THERE IS A new technology on the horizon that will forever change the information security and privacy industry landscape. Quantum computing, together with quantum communication, will have many beneficial applications but will also be capable of breaking many of today's most popular cryptographic techniques that help ensure data protection--in particular, confidentiality and integrity of sensitive information. These techniques are ubiquitously embedded in today's digital fabric and implemented by many industries such as finance, health care, utilities, and the broader information communication technology (ICT) community. It is therefore imperative for ICT executives to prepare for the transition from quantum-vulnerable to quantum-resistant technologies. [ABSTRACT FROM AUTHOR]

The article discusses the utilization of thermodynamics in computer science, particularly the concept of the development of a thermodynamic computing system (TCS) that combines traditional computing systems and new hardware to form Thermodynamic Computing (TC).

The article discusses quantum computing and the struggles involved with devising a quantum computer for cost effective practical use. The article examines the use of noisy, intermediate-scale quantum (NISQ) circuits, the cooling of superconducting qubits, and error rates of quantum computers.

The authors discuss what the response and responsibilities of the computing machinery and computing science industry should be to global climate change and what they refer to as a climate emergency. The article discusses computing efficiency, proposals concerning carbon offsets, and renewable energy.

We investigate the interplay between the graph isomorphism problem, logical definability, and structural graph theory on a rich family of dense graph classes: graph classes of bounded rank width. We prove that the combinatorial Weisfeiler-Leman algorithm of dimension (3k + 4) is a complete isomorphism test for the class of all graphs of rank width at most k. A consequence of our result is the first polynomial time canonization algorithm for graphs of bounded rank width. Our second main result addresses an open problem in descriptive complexity theory: we show that fixed-point logic with counting expresses precisely the polynomial time properties of graphs of bounded rank width. [ABSTRACT FROM AUTHOR]

The article discusses the ways in which the abstract mathematical models known as symbolic automata and variants were advantageous over finite-alphabet automata, and presents a summary of known theoretical results for symbolic models, extensions of symbolic automata, and elaborated upon the differences between symbolic models and finite-alphabet models.

The article argues that institutional change within the field of computer science (CS) is necessary to bring about social justice in CS and expand participation in CS. The article states that CS courses should be altered to connect it to the everyday lives of potential students, bring diverse perspectives to CS, and an understanding of the role of citizenship in CS.

The focus of this special section on computer science in Europe and Israel is introduced.

The article discusses the concept and theoretical foundations of secure multiparty computation (MPC), the strides made in making MPC efficient, and its initial use in commercial products. It also discusses the costs of MPC arrangements and how utilizing MPC can solve contemporary problems. It also discusses MPC security.

The article examines the difficulties introduced by errors and biases for the training of artificial intelligence (AI) and machine learning (ML) systems. It states that demands for increased fairness, accountability, and transparency (FAT) in AI is being sought by several groups. The article also discusses the benefits and drawbacks to training that relies upon Amazon's Mechanical Turk program.

The authors discuss the need for a new branch of computer science to develop accelerator-level parallelism in both computer hardware and software. They mention various forms of parallel processing that already exist, present a case study of mobile systems on a chip that are starting to rely on accelerator-level parallelism, and examine how the science might proceed in the future.