Search

Contributions: The underrepresentation of women in computer science (CS) majors has long been a focus of attention in many academic documents, the majority of them from the United States and Europe. There is, however, a lack of information about educational interventions (EIs) for women in computing in Latin America. The contribution of this article is to cover this gap and describe what researchers in Latin American countries have been publishing about the recruitment and retention of women in the CS field. Background: Many EIs targeting female students at different educational levels—K-12, undergraduate, and graduate—have been undertaken to increase the participation of women in computing in Latin America. However, descriptions of these activities rarely are included in international academic databases. Research Questions: This literature mapping addresses two main research questions (RQ) about the topic of women in computing in academic publications in Latin American countries: RQ1) what are the characteristics of the publications about women in computing in Latin America? and RQ2) what are the published interventions to recruit and retain women in computing in Latin America? To answer RQ1, six subquestions were created covering year, language, country of origin, document type, and professional track. Furthermore, for RQ2, two subquestions were created involving educational level and the use of software development with a female theme. Methodology: This investigation used the systematic literature mapping process. To achieve a broad coverage of papers, the following sources were included: Scopus, Web of Science, Google Scholar, EBSCO, the proceedings of the Latin American Women in Computing Conference (LAWCC), and those of the Women in Technology (WIT) workshop colocated with the annual conference of the Brazilian Computer Society (SBC). The included papers were published in the last decade (2010–2020) and written in English, Portuguese, or Spanish. Findings: The literature mapping encompasses 197 academic documents, 48.2% of which were written in Portuguese, 28.7% in English, and 23.1% in Spanish. The papers originated from 15 of the 20 Latin American countries. Brazil and Costa Rica have the highest number of publications overall. The documents describe initiatives to increase the participation of women in computing majors that cover the entire educational spectrum, from K-12 to graduate programs, but papers targeting populations in higher education have started to appear recently. [ABSTRACT FROM AUTHOR]

Background: More than 30 years ago, Harmon distinguished developmental research articles (RAs), which propose a solution to a problem, from experimental RAs, but the developmental format has received little attention. Literature review: Genre analysis of RAs has been largely restricted to articles following the standard experimental/Introduction, Methods, Results, Discussion (IMRD) format, thereby excluding many developmental engineering articles. Recently, a textbook proposed Introduction, Process, Testing, Conclusion (IPTC) as a prototypical format for electrical engineering RAs, but this format has not yet been demonstrated from a corpus. Research questions: 1. What is the macrostructure of electrical engineering RAs? 2. What are the characteristic features of each division of electrical engineering RAs? Methodology: Section headings, wordcount, and notable features were analyzed for 75 RAs from 15 electrical engineering journals and compared with both IPTC and Harmon's developmental structure. Results: Only one article, a case study, followed IMRD. Sixty-seven developmental RAs followed the IPTC format. These are distinguished by the second division (P), where the new solution is described, written in extended style, comprising several sections with headings specific to the research. A paragraph at the end of the Introduction describing the organization of the paper, the location of the theoretical framework and testing methods, and a ubiquitous Conclusion also differ from IMRD. Seven developmental RAs exhibited a hybrid format with the well-known IMRD section headings superimposed on an IPTC structure. Conclusions: Most electrical engineering articles are developmental and follow IPTC format. This can inform future genre analysis research and has pedagogical implications for teaching engineering writing. [ABSTRACT FROM AUTHOR]

Due to a pandemic situation arising from the past few decades and the covid-19 patients are increasing at the rapid rate. Looking in the near future an IOT model is build which can be useful for people in coming years and allows rapid testing and efficient testing methodologies using various sensors such as Temperature, Respiration, RFID etc which takes various parameters. The study focuses around 412 scientific documents such as Journals, articles, book chapters and Patents in various papers. These documents are extracted from the scopus databases after querying with the keywords related to covid patients and IOT. The articles were analysed for the time period of a few months. For this model, open source tools are used where analysis is done through Node XL, Gephi and VOSviewer. The survey prominently focuses on the type of publications, Publication by Country, Based on the geographical locations, Documents by Year, By Subject Area, By Affiliation and By Author. It was observed from the sides as English was a major language which was used in publishing of the documents. Study of Journal shows the sufficient contribution of Computer Science and Technology in detecting the Covid-19 patients. [ABSTRACT FROM AUTHOR]

Role assignment is a critical element in the role-based collaboration process. There are many different requirements to be considered when undertaking this task. This correspondence paper formalizes the group multirole assignment (GMRA) problem; proves the necessary and sufficient condition for the problem to have a feasible solution, provides an improved IBM ILOG CPLEX optimization package solution, and verifies the proposed solution with experiments. The contributions of this paper include: 1) the formalization of an important engineering problem, i.e., the GMRA problem; 2) a theoretical proof of the necessary and sufficient condition for GMRA to have a feasible solution; and 3) an improved ILOG solution to such a problem. [ABSTRACT FROM AUTHOR]

Given a graph $G$G and a vertex $q\in G$q∈G, the community search (CS) problem aims to efficiently find a subgraph of $G$G whose vertices are closely related to $q$q. Communities are prevalent in social and biological networks, and can be used in product advertisement and social event recommendation. In this paper, we study profiled community search (PCS), where CS is performed on a profiled graph. This is a graph in which each vertex has labels arranged in a hierarchical manner. Extensive experiments show that PCS can identify communities with themes that are common to their vertices, and is more effective than existing CS approaches. As a naive solution for PCS is highly expensive, we have also developed a tree index, which facilitates efficient and online solutions for PCS. [ABSTRACT FROM AUTHOR]

For software quality assurance, many safety-critical industries appeal to the use of dynamic testing and structural coverage criteria. However, there are reasons to doubt the adequacy of such practices. Mutation testing has been suggested as an alternative or complementary approach but its cost has traditionally hindered its adoption by industry, and there are limited studies applying it to real safety-critical code. This paper evaluates the effectiveness of state-of-the-art mutation testing on safety-critical code from within the U.K. nuclear industry, in terms of revealing flaws in test suites that already meet the structural coverage criteria recommended by relevant safety standards. It also assesses the practical feasibility of implementing such mutation testing in a real setting. We applied a conventional selective mutation approach to a C codebase supplied by a nuclear industry partner and measured the mutation score achieved by the existing test suite. We repeated the experiment using trivial compiler equivalence (TCE) to assess the benefit that it might provide. Using a conventional approach, it first appeared that the existing test suite only killed 82% of the mutants, but applying TCE revealed that it killed 92%. The difference was due to equivalent or duplicate mutants that TCE eliminated. We then added new tests to kill all the surviving mutants, increasing the test suite size by 18% in the process. In conclusion, mutation testing can potentially improve fault detection compared to structural-coverage-guided testing, and may be affordable in a nuclear industry context. The industry feedback on our results was positive, although further evidence is needed from application of mutation testing to software with known real faults. [ABSTRACT FROM AUTHOR]

Masking is a class of well-known countermeasure against side-channel attacks by employing the idea of secret sharing. In this paper, we propose a generic table recomputation-based masking scheme at any chosen order t , named divided S -box masking (DSM), and its security has been proved under the security framework from Crypto 2003. The table recomputation-based masking is suitable for software implementation and the masked table can be stored in memory, where it can be accessed fast. For any input, DSM scheme generates n output shares by two queries. DSM scheme requires two vectors L and R , and a matrix M of random numbers. Each element of L is the XOR result of the output of S -box and n-1 random numbers. These n-1 random numbers are stored in two lines of M and R which is a vector of indexes for the second query. Furthermore, we performed the attacks on the software implementation of DSM to evaluate its practical security, and compared the timing and space complexity with the existing table recomputation-based masking in the same platform to verify the advantage of the DSM. [ABSTRACT FROM AUTHOR]

Abstract: This short paper is based on the first named author’s final scientific conversations with Ludwik Finkelstein, it forms part of what was an on-going discussion whose aim was to bring together our work and perhaps to contribute to the further development of systems engineering. The paper argues for the creation of a new design discipline founded upon the convergence of measurement science and computer science. The convergence of these disciplines proceeds from both an improved appreciation of the fundamental relationships between the disciplines and from the technological developments that have brought measurement and computing ever closer together. The paper points to the underlying relationships between measurement science and computer science and suggests that these relationships can form a principled basis for tackling the design challenges that technological convergence presents. The paper concludes by setting out an initial agenda for the new discipline. [Copyright &y& Elsevier]

This paper proposes a scaffolded concept mapping strategy, which considers a student's (high or low) prior knowledge, and provides flexible learning aids (scaffolding and fading) for reading and drawing a concept map. The goal is that the whole class should progress in synchronized fashion through this strategy, with each student achieving meaningful learning. The scaffolding is tailored to the student's needs, with various levels of support. The increasing demand for scaffolding, and its constant evolution, means that software aids are needed. The authors adopted a systematic instructional design, with associated software, to create a learning environment that supports the execution of the strategy. The paper also investigates whether this strategy improved student learning for 54 undergraduates in a database management system course. The results indicate that the students who used the strategy had better learning achievements than those who only experienced traditional lectures. Moreover, the implementation of the strategy received positive student feedback. [ABSTRACT FROM AUTHOR]

In higher institutions of learning the level of interaction between students and their Lecturers is very stubby due to the nature of the work. Besides the teaching activity the lecturers are also engage in research and other administrative tasks. However, the lecturers can take visiting appointment in other institutions. In most circumstances the students can only meet their lecturers on scheduled time. This paper proposed a software approach in solving the problems of Students-Lecturer Interaction in Higher institutions of learning. The Software was developed using PHP and hosted in the University web server, and the interaction between students and their lecturers was compared using both the traditional approaches and the Software approach. The research was conducted on 3 four hundred level computer science courses at the Northwest University, Kano for a Semester and the results show that there is respective increase of 52%, 48% and 39% in the level of interaction as compared to traditional approaches. [ABSTRACT FROM AUTHOR]

The decreasing lifetime of NAND flash memory, as a side effect of recent advanced semiconductor process scaling, is emerging as one of major barriers to the wide adoption of SSDs in high-performance computing systems. In this paper, we propose Dynamic Erase Voltage and Time Scaling (DeVTS), an integrated approach to extend the lifetime (particularly, endurance) of NAND flash memory. DeVTS is motivated by our key observation that erasing a NAND block with a lower voltage or at a slower speed can significantly improve NAND endurance. However, using a lower erase voltage causes adverse side effects on the write performance and retention capability of NAND flash memory. In order to improve NAND endurance without affecting the other NAND requirements, we take advantage of idle times between write requests and variations of the retention requirement when writing data to a NAND block erased with a lower voltage. We have implemented a DeVTS-aware FTL, called dvsFTL, which exploits the tradeoff relationship between the endurance and erase voltages/times by accurately predicting the write performance and retention requirements. Our experimental results show that dvsFTL can improve NAND endurance by 94 percent, on average, over an existing DeVTS-unaware FTL while all the NAND requirements are preserved. [ABSTRACT FROM AUTHOR]

Mobile crowdsensing systems aim to provide various novel applications by employing pervasive smartphones. A key factor to enable such systems is substantial participation of normal smartphone users, which requires effective incentive mechanisms. In this paper, we investigate incentive mechanisms for online scenarios, where users arrive and interact with a task requester in a random order, and they have preferences (e.g., photographing) or limits (e.g., travel distance) over the sensing tasks. In existing online mechanisms, the task requester has limited power in assigning tasks to the selected users, i.e., it has to pay for all of the tasks specified by the selected users, although some of these tasks are of little value. To accommodate this, we investigate a more flexible setting, where the requester can actively assign most valuable tasks to the selected users. We design two online incentive mechanisms motivated by a sampling-accepting process and weighted maximum matching. We prove that the designed mechanisms achieve computational efficiency, individual rationality, budget feasibility, truthfulness, consumer sovereignty, and constant competitiveness. By carrying out extensive experiments on two real-world geographical datasets, we demonstrate the practical applicability of the proposed mechanisms. [ABSTRACT FROM AUTHOR]

There are a wide range of positions regarding the ontological nature of computer hardware and software. Moor [The British Journal for the Philosophy of Science 29 (1978), 213-222] argues that there is no significant ontological distinction between the two; Suber [The Journal of Speculative Philosophy 2 (1988), 89-119] argues that computer hardware is a kind of software; Colburn [The Monist (1999), 3-19] defines software as a special kind of entity he calls "concrete abstraction", and Turner [Minds and Machines 21 (2011), 135-152] classifies software as a specification. In this paper, I examine the positions of each philosopher, and based on this examination, define ontological categories that account for computer hardware and software. As a result, clear distinctions emerge between computer hardware and software: A software program is a specification that consists of one or more programming language instructions and whose concretization is embodied by an artifact that is designed so that a physical machine may read the concretized instructions, whereas hardware is an artifact whose functions are realized in processes that directly or indirectly bring about the result of some calculation. [ABSTRACT FROM AUTHOR]

Bug fixing is one of the most important activities in software development and maintenance. Bugs are reported, recorded, and managed in bug tracking systems such as Bugzilla. In general, a bug report contains many fields, such as product, component, severity, priority, fixer, operating system (OS), and platform, which provide important information for the bug triaging and fixing process. Our previous study finds that approximately 80% of bug reports have their fields reassigned and refined at least once, and bugs with reassigned and refined fields take more time to fix than bugs with no reassigned and refined fields. Thus, automatically predicting which bug report fields get reassigned and refined could help developers to save bug fixing time. Considering that a bug report could have multiple field reassignments and refinements (e.g., the product, component, fixer, and other fields of a bug report can get reassigned and refined), in this paper, we propose a multi-label learning algorithm to predict which bug report fields might be reassigned and refined. We note that the number of bug reports with some types of reassignment and refinement (e.g., bugs whose severity fields gets reassigned and refined) is a small proportion of the whole bug report collection, indicating the class imbalance problem. Thus, we propose imbalanced ML.KNN (Im-ML.KNN), which extends ML.KNN, one of the state-of-the-art multi-label learning algorithms, to achieve better performance. Im-ML.KNN is a composite model that combines 3 multi-label classifiers built using different types of features (i.e., meta, textual, and mixed features). We evaluate our solution on 4 large bug report datasets including OpenOffice, Netbeans, Eclipse, and Mozilla containing a total of 190,558 bug reports. We show that Im-ML.KNN can achieve an average F-measure score of 0.56–0.62. We also compare Im-ML.KNN with other state-of-art methods, such as the method proposed by Lamkanfi , ML.KNN, and HOMER-NB. The results show that Im-ML.KNN, on average, improves the average F-measure scores of Lamkanfi 's method, ML.KNN, and HOMER-NB by 119.69%, 9.11%, and 161.08%, respectively. [ABSTRACT FROM AUTHOR]

Networks-on-chip (NoCs) have been increasingly adopted in recent years due to the extensive integration of many components in modern multicore processors and system-on-chip designs. At the same time, transistor reliability is becoming a major concern due to the continuous scaling of silicon. As the sole medium of on-chip communication, it is critical for a NoC to be able to tolerate many permanent transistor failures. In this paper, we propose uDIREC, a unified framework for permanent fault diagnosis and subsequent reconfiguration in NoCs, which provides graceful performance degradation with an increasing number of faults. Upon in-field transistor failures, uDIREC leverages a fine-resolution diagnosis mechanism to disable faulty components very sparingly. At its core, uDIREC employs MOUNT, a novel routing algorithm to find reliable and deadlock-free routes that utilize all the still-functional links in the NoC. We implement uDIREC's reconfiguration as a truly-distributed hardware solution, still keeping the area overhead at a minimum. We also propose a software-implemented reconfiguration that provides greater integration with our software-based diagnosis scheme, at the cost of distributed nature of implementation. Regardless of the adopted implementation scheme, uDIREC places no restriction on topology, router architecture and number and location of faults. Experimental results show that uDIREC, implemented in a 64-node NoC, drops 3 $\times$ fewer nodes and provides greater than 25 percent throughput improvement (beyond 15 faults) when compared to other state-of-the-art fault-tolerance solutions. uDIREC's improvement over prior-art grows further with more faults, making it a effective NoC reliability solution for a wide range of fault rates. [ABSTRACT FROM AUTHOR]

The issue of plagiarism is discussed in the context of university education in disciplines related to computing. The focus is therefore mainly on software plagiarism. First, however, a case is made for the claim that the most important reason that plagiarism cannot be tolerated lies in the essence of the concept of a university as it is rooted in the Western cultural tradition. The main contribution of this paper is in providing firsthand insight into students' views on some of the delicate questions related to student plagiarism. However, this paper presents views from both sides of the question, including the views of staff members. This paper is quite unique in that it is coauthored by students who provide independent comments and recommendations. [ABSTRACT FROM AUTHOR]

This paper proposes a collaborative approach to enhancing the student learning experience based on Web 2.0 principles. Specifically, wiki Web sites are used by students for collaboration and for publication of course assignments, which are then shared with the class. Web 2.0 principles include: the Web as platform, harnessing collective intelligence, data are the next Intel Inside, and rich user experiences. Based on a case study in a junior-level undergraduate class, this paper studies a set of six factors with comprehensive grading and evaluation criteria that are critical to make this approach successful. The six factors are knowledge base, motivation, research, social aspects, presentation, and feedback and support. The data collected show that most of the students who participated feel that this approach is exciting and rewarding, and that even some undergraduate students are able to produce original and innovative concepts. The data also show other interesting phenomena with respect to motivation, undergraduate research, and social aspects. Finally, the paper proposes a methodology of conducting a wiki project in a university class using a cyclic constant improvement process. [ABSTRACT FROM AUTHOR]

Hardware-based courses in computer science studies require much effort from both students and teachers. The most important part of students' learning is attending in person and actively working on laboratory exercises on hardware equipment. This paper deals with a specific group of students, those who are marginalized by not being able to regularly attend lessons and perform the laboratory exercises. This group of “busy students” includes older students, and those who travel, are employed or are parents. In particular it describes how such students achieved impressive results in a hardware-based course by using Open Educational Resources (OER). These facilitated students' learning process and gave busy students the opportunity to organize their learning time so as to work on the hardware courses remotely from home when they had time and opportunity. The results of the evaluation show significant improvements, both in grade distribution and course throughput, after implementing the new Open Educational Resources approach. [ABSTRACT FROM AUTHOR]

Aspect-oriented software development has become an important development and maintenance approach to software engineering across requirements, design and implementation phases. However, discovering early aspects from requirements for a better integration of crosscutting concerns into a target system is still not well addressed in the existing works. In this paper, we propose a Goal-driven Early Aspect approach (called GEA) to discovering early aspects by means of a clustering algorithm in which relationships among goals and use cases are utilized to explore similarity degrees of clustering goals, and total interaction degrees are devised to check the validity of the formation of each cluster. Introducing early aspects not only enhances the goal-driven requirements modeling to manage crosscutting concerns, but also provides modularity insights into the analysis and design of software development. Moreover, relationships among goals represented numerically are more informative to discover early aspects and more easily to be processed computationally than qualitative terms. The proposed approach is illustrated by using two problem domains: a meeting scheduler system and a course enrollment system. An experiment is also conducted to evaluate the benefits of the proposed approach with Mann-Whitney U-test to show that the difference between with GEA and without GEA is statistically significant. [ABSTRACT FROM PUBLISHER]

Algebraic specifications have been used in the testing of object-oriented programs and received much attention since the 1990s. It is generally believed that class-level testing based on algebraic specifications involves two independent aspects: the testing of equivalent and nonequivalent ground terms. Researchers have cited intuitive examples to illustrate the philosophy that even if an implementation satisfies all the requirements specified by the equivalence of ground terms, it may still fail to satisfy some of the requirements specified by the nonequivalence of ground terms. Thus, both the testing of equivalent ground terms and the testing of nonequivalent ground terms have been considered as significant and cannot replace each other. In this paper, we present an innovative finding that, given any canonical specification of a class with proper imports, a complete implementation satisfies all the observationally equivalent ground terms if and only if it satisfies all the observationally nonequivalent ground terms. As a result, these two aspects of software testing cover each other and can therefore replace each other. These findings provide a deeper understanding of software testing based on algebraic specifications, rendering the theory more elegant and complete. We also highlight a couple of important practical implications of our theoretical results. [ABSTRACT FROM PUBLISHER]

Due to the fast evolution of the information on the Internet, update summarization has received much attention in recent years. It is to summarize an evolutionary document collection at current time supposing the users have read some related previous documents. In this paper, we propose a graph-ranking-based method. It performs constrained reinforcements on a sentence graph, which unifies previous and current documents, to determine the salience of the sentences. The constraints ensure that the most salient sentences in current documents are updates to previous documents. Since this method is NP-hard, we then propose its approximate method, which is polynomial time solvable. Experiments on the TAC 2008 and 2009 benchmark data sets show the effectiveness and efficiency of our method. [ABSTRACT FROM AUTHOR]

Constructivist approaches to computer science education emphasize that as well as knowledge, thinking skills and processes are involved in active knowledge construction. K–12 computer science curricula must not be based on fashions and trends, but on contents and processes that are observable in various domains of computer science, that can be taught at every intellectual level, that will stay relevant in the longer term, and that are related to everyday language and/or thinking. Only recently, two empirically determined lists, one of central content concepts (algorithm, computer, data, system, etc.) and another of central process concepts (problem solving and problem posing, analyzing, classifying, generalizing, etc.), have become available for computer science education. This paper tackles the problem of finding content and process concepts to be taught in combination. Computer science experts are surveyed in order to identify combinations of content and process concepts—so-called blocks—that are relevant to computer science education. By using cluster analyses, 15 central blocks for teaching computer science in schools are determined. The results of this study may serve as a reference system for the systematic design of instruction in K–12 computer science education. [ABSTRACT FROM AUTHOR]

Adaptability of software systems is of serious concern to practitioners. Loosely speaking, adaptability could be defined as the ability of a system to accommodate varying user requirements with little to no intervention from the developer. Implementing adaptability in web-based systems, however, poses challenges of its own. Web-based applications are usually large (in terms of components, lines of code, etc.), complex, and utilize numerous software packages usually supplied by different third-party vendors. It will be very useful to the software engineering community if an adaptable framework is available that can be quickly tailored to today''s demanding software requirements, and be easy to re-use. In this paper, a framework is presented, called the Hobbes Framework (HF) that has helped solve many of the current challenges regarding adaptability. HF has been used extensively in two major web-based projects and is currently being implemented in another. HF has proven highly adaptable to varying project and user requirements. [Copyright &y& Elsevier]