300 results
Search Results
2. Sampling Near Neighbors in Search for Fairness.
- Author
-
Aumüller, Martin, Har-Peled, Sariel, Mahabadi, Sepideh, Pagh, Rasmus, and Silvestri, Francesco
- Subjects
- *
DATA , *FAIRNESS , *DATABASE searching , *SEARCH algorithms , *COMPUTER algorithms , *COMPUTER science , *COMPUTER programming - Abstract
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]
- Published
- 2022
- Full Text
- View/download PDF
3. Resolution of the Burrows-Wheeler Transform Conjecture.
- Author
-
Kempa, Dominik and Kociumaka, Tomasz
- Subjects
- *
COMPUTER programming , *COMPUTERS in lexicography , *ALGORITHMS , *DATA structures , *COMPUTER science - Abstract
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]
- Published
- 2022
- Full Text
- View/download PDF
4. Hands on programming: Teachers' use of Metaphors in gesture and Speech make Abstract concepts tangible.
- Author
-
Larsson, Andreas and Stolpe, Karin
- Subjects
- *
COMPUTER programming , *CLASSROOMS , *COGNITIVE linguistics , *COMPUTER science , *EDUCATORS - Abstract
Metaphors in gesture and speech play a pivotal role in the way that programming concepts are presented in the classroom. However, little is known about the function of teachers' metaphors in practice. This study aims to explore teachers' use of metaphors in gesture and speech in a lecture on programming. Based on video observations of three upper secondary teachers, we employ Metaphor Identification Procedure (MIP) and Metaphor Identification for Gesture Guidelines (MIG-G) as methodological tools for identifying metaphoric speech and gestures related to programming concepts. The results of the study reveal that the gestures of the three teachers mainly function in two ways: (1) to add spatial properties to a programming concept and (2) to provide additional imagery for a programming concept. Consequently, the gestures identified in this study reduce the communicative burden of teachers' speech. Furthermore, the study reveals that teachers' gestures serve as means for making abstract concepts more tangible. For example, gestures concerning the abstract term "data" can generally be related to an object that could be received or moved. Hence, despite its metaphorical origin, data could be considered a graspable aspect of programming. Furthermore, spatial gestures enable the teachers to communicate programming processes in a tangible way, for example assigning programming processes a forward direction. Theoretical implications, potential implications for teaching and future research are discussed in the paper. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
5. Code the mime: A 3D programmable charades game for computational thinking in MaLT2.
- Author
-
Grizioti, Marianthi and Kynigos, Chronis
- Subjects
- *
COMPUTER science , *EDUCATIONAL games , *GEOMETRY , *COMPUTER programming , *LEARNING theories in education - Abstract
In this paper, we discuss the need for new approaches to research regarding coding to support students in developing practices in computational thinking, such as abstraction and decomposition, in multidisciplinary contexts. We explore students' activities with a tool integrating constructionist textual programming activity with game‐based learning and specifically game modding. In this context, we designed a programmable 'design‐to‐play' game developed with the computational environment MaLT2. MaLT2 offers the affordances of textual programming, dynamic manipulation, and 3D navigation for the design of 3D animated models aiming to give children access to, otherwise, complex, computational and mathematical ideas. To develop an understanding of children's learning activity regarding computational practices, we organised an empirical study with middle‐school students, who played a game called 'Code‐the‐Mime'. It is a charades‐based game in which the players manipulate, programme, and modify a digital human model to describe a word to their teammates. The preliminary findings indicate that the affordances of MaLT2 in conjunction with the game context enabled students to express and develop key computational practices, including decomposition, pattern recognition, analysis and abstraction, in a meaningful and multidisciplinary context. Practitioner notesWhat is already known about this topic Computational Thinking is considered a key 21st‐century skill in preparing the young to become digital citizens. It involves concepts and practices that can be used to solve problems computationally across multiple fields. However, there is still limited knowledge of how students develop computational practices, such as abstraction, pattern recognition, decomposition, and how they may express and apply them in diverse contexts. Students' engagement with computational practices is unlikely to be supported either by closed, simplified coding tasks or higher‐level advanced programming exercises. There is a need to clarify the manifestation of these practices and how they can be realised and expressed and used by learners in meaningful and transdisciplinary contexts.What this paper adds It suggests the design of constructionist computational games that integrate design and programming into the gameplay, aiming to engage students with computational practices in a multidisciplinary, authentic context. It provides an example of a 'design‐to‐play' charades‐like game, developed in a 3D modelling programming environment, that embeds real‐life representations into computational design, to enable 'syntonic learning' of computational practices. Furthermore, it analyses student learning activity to elaborate on arguments and issues related to this approach.Implications for practice and/or policy There is added value in disconnecting computational thinking from positivist diagnostic approaches related to respective concepts and studying it in ways more related to realistic problem‐solving situations and multidisciplinary contexts. The study contributes to the scientific clarification of computational practices concerning how they are being realised and expressed by the students in different contexts through an original example of educational practice. The discussed approach and tools can contribute to the design and development of innovative digital media, embedding affordances for concepts and practices while maintaining relevance and interest for their users. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
6. Selected and extended papers from SBLP 2013.
- Author
-
Rauber Du Bois, André and Trinder, Phil
- Subjects
- *
COMPUTER programming , *PROGRAMMING languages , *SOFTWARE engineering , *COMPUTER science - Published
- 2016
- Full Text
- View/download PDF
7. Guest Editorial Special Issue "Recent Trends on Advanced Computing: The Converging Technologies".
- Author
-
Tchernykh, Andrei, Juárez Ramírez, Reyes, Mocskos, Esteban, and Nesmachnow, Sergio
- Subjects
- *
HIGH performance computing , *COMPUTER vision , *COMPUTER software , *COMPUTER science , *COMPUTER programming , *SOFTWARE engineering , *SOFTWARE measurement - Abstract
This document is a guest editorial for a special issue of the journal "Programming & Computer Software" titled "Recent Trends on Advanced Computing: The Converging Technologies." The issue features research and practical implementation results from researchers and industry experts in computer science, engineering, and technology. The papers cover a range of topics including microservices, software quality, user engagement on social media, non-functional requirements, medical software architecture, fallacies in political speeches, intelligent learning environments, and more. The guest editors for this special issue are Prof. Dr. Andrei Tchernykh, Prof. Reyes Juárez Ramírez, Dr. Esteban Mocskos, and Prof. Sergio Nesmachnow. [Extracted from the article]
- Published
- 2023
- Full Text
- View/download PDF
8. Engineering and Computer Science Paper Abstracts.
- Subjects
- *
COMPUTER science , *COMPUTER programming , *SEMANTICS , *KINEMATICS - Abstract
The article presents abstracts on engineering and computer science research presented during the 86th Annual Academy of Science Meeting at the University of West Alabama in Livingston from March 25-27, 2009 including one on the Jibu software library for concurrent programming, another on the kinematic structure of the bow echo observed on March 9, 2006 between Alabama and Mississippi, and one on a semantics-based method for extracting concepts from large documents.
- Published
- 2009
9. THE 1981 GEORGE E. FORSYTHE STUDENT PAPER COMPETITION.
- Subjects
- *
COMPUTER programming , *DEBUGGING , *AWARDS , *COMPUTER science - Abstract
The article presents information on a research paper related to computer programming and debugging, which won an award in the 1981 George E. Forsythe Student Paper Competition. The research paper "A Program Testing Assistant," by David Chapman, a graduate student, was selected because of its original and incisive research into program development and debugging. The competition memorializes George E. Forsythe, president of the Association for Computing Machinery from 1964 to 1966, and leader in the development of computer science as a separate discipline. Chapman will receive a cash award of 500 dollars and a certificate. The papers of the first competition were refereed and judged by a committee of graduate students. The tradition has continued, with each competition administered by the graduate students at a major university with the assistance of a faculty advisor. For 1981, it was a committee of graduate students in computer science at Cornell University, New York, with professor David J. Gries serving as faculty advisor.
- Published
- 1982
10. TEACHING MOBILE DEVELOPMENT WITH APP INVENTOR AND PAIR PROGRAMMING.
- Author
-
Musmarra, Paolo
- Subjects
- *
COMPUTER programming , *COMPUTER software development , *COMPUTER software , *COMPUTER science , *INFORMATION technology - Abstract
The relationship of the teenagers with the new technologies is very complex and it is the center of attention today for the schools. Everyone is always connected: some searches show that the teenagers under 18 spend online about ten hours every day and are connected also for 24 hours with mobile devices and thanks to free wi-fi. Pair programming is a collaboration paradigm that has been strongly adopted in particular in the computer science education. In fact, Pair Programming has demonstrated benefits for many aspects in education, but unique concerns of mobile software design raise questions about the effectiveness of Pair Programming in this evolving field. This paper probes unique challenges for Pair Programming when used in mobile software design classes, focusing on four mobile design topics: dealing with interface and data management, recording and playing audio via mobile device and App Inventor components, using sensors and collecting GPS data from mobile device, using a TinyBD component of App Inventor for storage data. The paper highlights successes and challenges for Pair Programming and mobile applications, concluding with recommendations on building assignments. [ABSTRACT FROM AUTHOR]
- Published
- 2018
11. A framework for defining coupling metrics.
- Author
-
Tempero, Ewan and Ralph, Paul
- Subjects
- *
COMPUTER programming , *COMPUTER science , *REIFICATION , *PHILOSOPHY , *MATHEMATICAL models - Abstract
Abstract Many metrics have been proposed to measure coupling—the degree of association between modules in a system. They have often been described in different ways, hindering comparison and research. Their definitions are often incomplete regarding language features in some languages, meaning that different tool developers may implement the same metric differently. This complicates comparing results from studies that use different tools. This paper therefore aims to define coupling metrics consistently and unambiguously. The paper describes a model of coupling that uses the reification of the concept of dependency as its fundamental unit. Based on this model, it defines a framework for defining coupling metrics. It shows how to define several well-known coupling metrics in the framework, and how defining different metrics based on the same model facilitates direct comparisons. It discusses how the framework resolves issues due to incomplete metric definitions, such as different language features. This formal framework is sufficiently simple that it can be implemented in such a way as to provide multiple metrics. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
12. Parallelization of the FICO Xpress-Optimizer.
- Author
-
Berthold, Timo, Farmer, James, Heinz, Stefan, and Perregaard, Michael
- Subjects
- *
COMPUTER programming , *INDUSTRIAL applications , *REPRODUCIBLE research , *STATISTICAL reliability , *COMPUTER science - Abstract
Computing hardware has mostly thrashed out the physical limits for speeding up individual computing cores. Consequently, the main line of progress for new hardware is growing the number of computing cores within a single CPU. This makes the study of efficient parallelization schemes for computation-intensive algorithms more and more important. A natural precondition to achieving reasonable speedups from parallelization is maintaining a high workload of the available computational resources. At the same time, reproducibility and reliability are key requirements for software that is used in industrial applications. In this paper, we present the new parallelization concept for the state-of-the-art MIP solver FICO Xpress-Optimizer. MIP solvers like Xpress are expected to be deterministic. This inevitably results in synchronization latencies which render the goal of a satisfying workload a challenge in itself. We address this challenge by following a partial information approach and separating the concepts of simultaneous tasks and independent threads from each other. Our computational results indicate that this leads to a much higher CPU workload and thereby to an improved, almost linear, scaling on modern high-performance CPUs. As an added value, the solution path that Xpress takes is not only deterministic in a fixed environment, but also, to a certain extent, thread-independent. This paper is an extended version of Berthold
et al. [Parallelization of the FICO Xpress-Optimizer , inMathematical Software - ICMS 2016: 5th International Conference , G.-M. Greuel, T. Koch, P. Paule, and A. Sommere, eds., Springer International Publishing, Berlin, 2016, pp. 251-258] containing more detailed technical descriptions, illustrative examples and updated computational results. [ABSTRACT FROM AUTHOR]- Published
- 2018
- Full Text
- View/download PDF
13. All Roads Lead to Computing: Making, Participatory Simulations, and Social Computing as Pathways to Computer Science.
- Author
-
Brady, Corey, Orton, Kai, Weintrop, David, Anton, Gabriella, Rodriguez, Sebastian, and Wilensky, Uri
- Subjects
- *
COMPUTER science , *SOCIAL computing , *COMPUTER simulation , *COMPUTER programming , *STUDENT-centered learning , *HARDWARE , *COMPUTER network resources - Abstract
Computer science (CS) is becoming an increasingly diverse domain. This paper reports on an initiative designed to introduce underrepresented populations to computing using an eclectic, multifaceted approach. As part of a yearlong computing course, students engage in Maker activities, participatory simulations, and computing projects that foreground the social and collaborative aspects of CS. Collectively, these activities are designed to introduce learners to the growing diversity of what CS looks like in the 21st century. This paper lays out the practical and theoretical motivations for the Computational Thinking for Girls (CT4G) project, specifically highlighting the use of Making through physical and social computing as ways to engage students in CS. A snapshot of one activity from the program is provided—Wearing the Web—in which students use open-hardware programmable badges to explore the underlying structure and technology that enables the Internet. Data from the first year of the CT4G program are presented to show the positive effects that this diverse introduction to CS is having on the students with respect to their attitudes toward CS. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
14. Building Capacity for Computational Thinking in Youth through Informal Education.
- Author
-
Mesiti, Leigh Ann, Parkes, Alana, Paneto, Sunewan C., and Cahill, Clara
- Subjects
- *
NONFORMAL education , *TRAVELING exhibitions , *YOUTH , *COMPUTER programming , *COMPUTER science - Abstract
Building Computational Thinkers, a three-year research study, explored how educators and designers can most effectively support the development of computational thinking capacity, and how these learning experiences could be customized to meet the needs of different learners. This research study focused on three specific exhibit design approaches that conveyed problem decomposition content in The Science Behind Pixar (Pixar), a 13,000 square foot traveling exhibition about the computer science, mathematics, and science behind Pixar's innovative films. Phase One investigated how novice learners could be supported to interact with exhibits and understand problem solving strategies that tackle complex, creative challenges in computer programming. Phase Two investigated the affordances of these exhibits to build capacity, feelings of efficacy, and interest in problem decomposition content in middle and high school youth. The findings in this paper describe the types of scaffolds that can be used to support computational thinking in novice youth, as well as how a combination of exhibit approaches were found to increase youth perceptions, understanding, and beliefs of computer programming. It will also discuss how two exhibit approaches worked particularly well for engaging girls in problem decomposition content. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
15. Discovering frequent induced subgraphs from directed networks.
- Author
-
Zhang, Sen, Du, Zhihui, Wang, Jason T. L., and Jiang, Haodi
- Subjects
- *
SUBGRAPHS , *COMPUTER science , *MEDICINE , *GENE regulatory networks , *COMPUTER programming , *ALGORITHMS - Abstract
Directed networks find many applications in computer science, social science and biomedicine, among others. In this paper we propose a new graph mining algorithm that is capable of locating all frequent induced subgraphs in a given set of directed networks. We present an incremental coding scheme for representing the canonical form of a graph, study its properties, and develop new techniques for pattern generation suitable for directed networks. We prove that our algorithm is complete, meaning that no qualified pattern is missed by the algorithm. Furthermore, our algorithm is correct in the sense that all patterns found by the algorithm are frequent induced subgraphs in the given networks. Experimental results based on synthetic data and gene regulatory networks show the good performance of our algorithm, and its application in network inference. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
16. A Computational Conundrum: “What is a Computer?” A Historical Overview.
- Author
-
Berkeley, Istvan S. N.
- Subjects
- *
COMPUTER science , *COMPUTATIONAL complexity , *TURING (Computer program language) , *COMPUTER programming , *SYSTEMS theory , *HISTORY - Abstract
This introduction begins by posing the question that this Special Issue addresses and briefly considers historical precedents and why the issue is important. The discussion then moves on to the consideration of important milestones in the history of computing, up until the present time. A brief specification of the essential components of computational systems is then offered. The final section introduces the papers that are included in this volume. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
17. x86-TSO: A Rigorous and Usable Programmer's Model for x86 Multiprocessors.
- Author
-
Sewell, Peter, Sarkar, Susmit, Owens, Scott, Nardelli, Francesco Zappa, and Myreen, Magnus O.
- Subjects
- *
MULTIPROCESSORS , *COMPUTER software correctness , *COMPUTER programming , *DISTRIBUTED shared memory , *COMPUTER multitasking , *COMPUTER science - Abstract
Exploiting the multiprocessors that have recently become ubiquitous requires high-performance and reliable concurrent systems code, for concurrent data structures, operating system kernels, synchronization libraries, compilers, and so on. However, concurrent programming, which is always challenging, is made much more so by two problems. First, real multiprocessors typically do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have relaxed memory models, varying in subtle ways between processor families, in which different hardware threads may have only loosely consistent views of a shared memory. Second, the public vendor architectures, supposedly specifying what programmers can rely on, are often in ambiguous informal prose (a particularly poor medium for loose specifications), leading to widespread confusion. In this paper we focus on x86 processors. We review several recent Intel and AMD specifications, showing that all contain serious ambiguities, some are arguably too weak to program above, and some are simply unsound with respect to actual hardware. We present a new x86-TSO programmer's model that, to the best of our knowledge, suffers from none of these problems. It is mathematically precise (rigorously defined in HOL4) but can be presented as an intuitive abstract machine which should be widely accessible to working programmers. We illustrate how this can be used to reason about the correctness of a Linux spinlock implementation and describe a general theory of data-race freedom for x86-TSO. This should put x86 multiprocessor system building on a more solid foundation; it should also provide a basis for future work on verification of such systems. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
18. Variable-Precision Exponentiation.
- Author
-
Richman, P. L. and Timlake, W. P.
- Subjects
- *
COMPUTER algorithms , *COMPUTER programming , *ARTIFICIAL intelligence , *PROGRAMMING languages , *ELECTRONIC data processing , *COMPUTER science - Abstract
A previous paper presented an efficient algorithm, called the Recomputation Algorithm, for evaluating a rational expression to within any desired tolerance on a computer which performs variable-precision arithmetic operations. The Recomputation Algorithm can be applied to expressions involving any variable-precision operations having O(10-... + Σ ∣ε∣) error bounds, where p denotes the operation's precision and ε, denotes the error in the operation's with argument. This paper presents an efficient variable-precision exponential operation with an error bound of the above order. Other operations, such as log, sin, and cos, which have simple series expansions, can be handled similarly. [ABSTRACT FROM AUTHOR]
- Published
- 1973
- Full Text
- View/download PDF
19. CHAPTERS.
- Subjects
- *
ELECTRONIC data processing , *COMPUTER training , *COMPUTER science , *COMPUTER programming - Abstract
The article presents information on various chapters of the Association for Computing Machinery (ACM) across the U.S. The Greater Rio Grande Chapter of ACM has recently extracted from its files a list of the titles of all technical papers presented at Chapter meetings since its inception in 1957. Using a program developed by D.K. Robbins of Sandia Corp., a KWIC-type listing of permuted titles of these papers has been made. This listing has been distributed to all members of the Chapter. Topics and speakers at ACM Chapters across the U.S. indicate the current trends of interest in computer science and data processing. The ACM Tidewater Chapter is sponsoring this spring a professional development course on "Real-Time Computing." The course is given by the Chapter's professional development chairman, Cecil Frost, who is applications staff specialist for Control Data Corp. At its April 21, 1966 meeting, the Westchester-Fairfield Chapter heard William Orchard-Hays speak on "Linear Programming of Computational Techniques."
- Published
- 1966
20. Hybrid Water Flow-like Algorithm with Tabu Search for Traveling Salesman Problem.
- Author
-
Bostamam, Jasmin M. and Othman, Zulaiha
- Subjects
- *
COMPUTER algorithms , *COMPUTER programming , *COMPUTER science , *COMPUTER engineering , *METAHEURISTIC algorithms - Abstract
This paper presents a hybrid Water Flow-like Algorithm with Tabu Search for solving travelling salesman problem (WFA-TS-TSP).WFA has been proven its outstanding performances in solving TSP meanwhile TS is a conventional algorithm which has been used since decades to solve various combinatorial optimization problem including TSP. Hybridization between WFA with TS provides a better balance of exploration and exploitation criteria which are the key elements in determining the performance of one metaheuristic. TS use two different local search namely, 2opt and 3opt separately. The proposed WFA-TSTSP is tested on 23 sets on the well-known benchmarked symmetric TSP instances. The result shows that the proposed WFA-TSTSP has significant better quality solutions compared to WFA. The result also shows that the WFA-TS-TSP with 3-opt obtained the best quality solution. With the result obtained, it could be concluded that WFA has potential to be further improved by using hybrid technique or using better local search technique. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
21. Enhancing context knowledge repositories with justifiable exceptions.
- Author
-
Bozzato, Loris, Eiter, Thomas, and Serafini, Luciano
- Subjects
- *
SEMANTIC computing , *COMPUTER science , *DESCRIPTION logics , *INFORMATION theory , *COMPUTER programming - Abstract
Dealing with context dependent knowledge is a well-known area of study that roots in John McCarthy's seminal work. More recently, the Contextualized Knowledge Repository (CKR) framework has been conceived as a logic-based approach in which knowledge bases have a two layered structure, modeled by a global context and a set of local contexts. The global context not only contains the meta-knowledge defining the properties of local contexts, but also holds the global (context independent) object knowledge that is shared by all of the local contexts. In many practical cases, however, it is desirable to leave the possibility to “override” the global object knowledge at the local level: in other words, it is interesting to recognize the pieces of knowledge that can admit exceptional instances in the local contexts that do not need to satisfy the general axiom. To address this need, we present in this paper an extension of CKR in which defeasible axioms can be included in the global context. The latter are verified in the local contexts only for the instances for which no exception to overriding exists, where exceptions require a justification in terms of facts that are provable from the knowledge base. We formally define this semantics and study some semantic and computational properties, where we characterize the complexity of the major reasoning tasks, among them satisfiability testing, instance checking, and conjunctive query answering. Furthermore, we present a translation of extended CKRs with knowledge bases in the Description Logic SROIQ -RL under the novel semantics to datalog programs under the stable model (answer set) semantics. We also present an implementation prototype and examine its scalability with respect to the size of the input CKR and the amount (level) of defeasibility in experiments. Finally, we compare our representation approach with some major formalisms for expressing defeasible knowledge in Description Logics and contextual knowledge representation. Our work adds to the body of results on using deductive database technology such as SQL and datalog in these areas, and provides an expressive formalism (in terms of intrinsic complexity) for exception handling by overriding. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
22. Using IOIOAI in introductory courses to embedded systems for engineering students: a case study.
- Author
-
Chtourou, Slim, Kharrat, Mohamed, Amor, Nader Ben, Jallouli, Mohamed, and Abid, Mohamed
- Subjects
- *
EMBEDDED computer systems , *CURRICULUM , *ENGINEERING students , *CLOUD computing , *COMPUTER science , *COMPUTER programming - Abstract
The technological world has witnessed many revolutions since the beginning of the 21st century, such as mobile development, cloud computing, big data, artificial intelligence and also the Internet of Things. The internet of things revolution is driven by a broader access to internet and versatility of programmable hardware devices that can communicate between each other. In order to make internet of things devices, a technical background is required in many fields, especially electronics and Computer Science. Therefore, many efforts are put in place to develop educational kits that simplify the basics of these two fields so that everyone can make his internet of things prototype without technical knowledge. The authors present their own initiative: IOIOAI that simplifies the programming process for the input output input output electrical board. The service has been tested successfully on children and young students. In this paper, the authors present a wider adoption for their initiative. The IOIOAI service is imple- mented in introductory course to embedded systems for electrical and computer science students during the 2016-2017 academic year in the National Engineering School of Sfax, Tunisia. The efficiency of the solution is analyzed based on the students' marks and feedback. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
23. Reducing the Retrieval Time of Hashing Method by Using Predictors.
- Author
-
Nishihara, Seiichi and Ikeda, Katsuo
- Subjects
- *
HASHING , *COMPUTER programming , *ELECTRONIC file management , *COMPUTER algorithms , *COMPUTER science - Abstract
Many methods for resolving collisions in hashing techniques have been proposed. They are classified into two main categories: open addressing and chaining. In this paper, other methods are presented that are intermediate between the two categories. The basic idea of our methods is the use of one or more predictors reserved per cell instead of a link field as in the chaining method. The predictors are used to maintain loose synonym chains. After describing the methods, the efficiencies are estimated theoretically and verified experimentally. In comparison with the chaining method, we prove that our methods significantly reduce the average number of probes necessary to retrieve a key without expending extra space. [ABSTRACT FROM AUTHOR]
- Published
- 1983
- Full Text
- View/download PDF
24. A Program Testing Assistant.
- Author
-
Chapman, David
- Subjects
- *
COMPUTER software testing , *COMPUTER programming , *DEBUGGING , *COMPUTER science , *INFORMATION technology , *COMPUTER algorithms - Abstract
This paper describes the design and implementation of a program testing assistant which aids a programmer in the definition, execution, and modification of test cases during incremental program development. The testing assistant helps in the interactive definition of test cases and executes them automatically when appropriate. It modifies test cases to preserve their usefulness when the program they test undergoes certain types of design Changes. The testing assistant acts as a fully integrated part of the programming environment and cooperates with existing programming tools such as a display editor, compiler, interpreter, and debugger. [ABSTRACT FROM AUTHOR]
- Published
- 1982
- Full Text
- View/download PDF
25. Algorithms for Computing the Volume and Other Integral Properties of Solids. I. Known Methods and Open Issues.
- Author
-
Yong Tsui Lee, Requicha, Aristides A. G., and Fritsch, Fred
- Subjects
- *
COMPUTER algorithms , *SOLID geometry , *MATHEMATICAL analysis , *COMPUTER science , *INFORMATION technology , *COMPUTER programming - Abstract
The volume, moments of inertia, and similar properties of solids are defined by triple (volumetric) integrals over subsets of three-dimensional Euclidean space. The automatic computation of such integral properties for geometrically complex solids is important in CAD/CAM, robotics, and other fields and raises interesting mathematical and computational problems that have received little attention from numerical analysts and computer scientists. This paper summarizes the known methods for calculating integral properties of solids that may be geometrically complex and identifies some significant gaps in our current knowledge. [ABSTRACT FROM AUTHOR]
- Published
- 1982
- Full Text
- View/download PDF
26. Beyond Programming Languages.
- Author
-
Winograd, Terry
- Subjects
- *
COMPUTER programming , *PROGRAMMING languages , *COMPUTER software , *COMPUTERS , *COMPUTER algorithms , *COMPUTER science - Abstract
As computer technology matures, our growing ability to create large systems is leading to basic changes in the nature of programming. Current programming language concepts will not be adequate for building and maintaining systems of the complexity called for by the tasks we attempt. Just as high level languages enabled the programmer to escape from the intricacies of a machine's order code, higher level programming systems can provide the means to understand and manipulate complex systems and components. In order to develop such systems, we need to shift our attention away from the detailed specification of algorithms, towards the description of the properties of the packages and objects with which we build. This paper analyzes some of the shortcomings of programming languages as they now exist, and lays out some possible directions for future research. [ABSTRACT FROM AUTHOR]
- Published
- 1979
- Full Text
- View/download PDF
27. An Example of Hierarchical Design and Proof.
- Author
-
Spitzen, Jay M., Levitt, Karl N., Robinson, Lawrence, and Horning, J. J.
- Subjects
- *
COMPUTER programming , *PROGRAMMING languages , *ELECTRONIC data processing , *COMPUTER science , *COMPUTER software - Abstract
Hierarchical programming is being increasingly recognized as helpful in the construction of large programs. Users of hierarchical techniques claim or predict substantial increases in productivity and in the reliability of the programs produced. In this paper we describe a formal method for hierarchical program specification, implementation, and proof. We apply this method to a significant list processing problem and also discuss a number of extensions to current programming languages that ease hierarchical program design and proof. [ABSTRACT FROM AUTHOR]
- Published
- 1978
- Full Text
- View/download PDF
28. Abstract Data Types and Software Validation.
- Author
-
Guttag, John V., Horowitz, Ellis, Musser, David R., and Horning, J. J.
- Subjects
- *
ABSTRACT data types (Computer science) , *COMPUTER programming , *SOFTWARE validation , *PROGRAMMING languages , *AXIOMS , *COMPUTER science - Abstract
A data abstraction can be naturally specified using algebraic axioms. The virtue of these axioms is that they permit a representation-independent formal specification of a data type. An example is given which shows how to employ algebraic axioms at successive levels of implementation. The major thrust of the paper is twofold. First, it is shown how the use of algebraic axiomatizations can simplify the process of proving the correctness of an implementation of an abstract data type. Second, semi-automatic tools are described which can be used both to automate such proofs of correctness and to derive an immediate implementation from the axioms. This implementation allows for limited testing of programs at design time, before a conventional implementation is accomplished. [ABSTRACT FROM AUTHOR]
- Published
- 1978
- Full Text
- View/download PDF
29. A Survey of Computer Science Offerings In Small Liberal Arts Colleges.
- Author
-
Lopez, A. A., Raymond, Robert, and Tardiff, Robert
- Subjects
- *
COLLEGE curriculum , *CURRICULUM , *COMPUTER science , *HUMANISTIC education , *COMPUTER programming , *COMPUTER algorithms - Abstract
Recent curricular development in computer science together with student interest in pursuing topics in computer science beyond the usual programming courses have encouraged small liberal arts colleges to expand their offerings. This paper summarizes the results of a survey taken to determine the type of computer science programs being offered in these colleges. The results indicate that over half of these colleges either have no computer science program or offer only programming courses. [ABSTRACT FROM AUTHOR]
- Published
- 1977
- Full Text
- View/download PDF
30. Exception Handling: Issues and a Proposed Notation.
- Author
-
Goodenough, John B.
- Subjects
- *
PROGRAMMING languages , *COMPUTER programming , *C (Computer program language) , *ARTIFICIAL languages , *DOCUMENT markup languages , *SEMANTICS , *COMPUTATIONAL linguistics , *COMPUTER algorithms , *COMPUTER science - Abstract
This paper defines exception conditions, discusses the requirements exception handling language features must satisfy, and proposes some new language features for dealing, with exceptions in an orderly and reliable way. The proposed language features serve to highlight exception handling issues by showing how deficiencies in current approaches can be remedied. [ABSTRACT FROM AUTHOR]
- Published
- 1975
- Full Text
- View/download PDF
31. A Geneaology of Control Structures.
- Author
-
Ledgard, Henry F. and Marcotty, Michael
- Subjects
- *
DATA structures , *COMPUTER programming , *ABSTRACT data types (Computer science) , *ABSTRACT thought , *COMPUTER programmers , *COMPUTER software , *COMPUTERS , *COMPUTER science , *TECHNOLOGY - Abstract
The issue of program control structures has had a history of heated controversy. To put this issue on a solid footing, this paper reviews numerous theoretical results on control structures and explores their practical implications. The classic result of Böhm and Jacopini on the theoretical completeness of if-then-else and while-do is discussed. Several recent ideas on control structures are then explored. These include a review of various other control structures, results on time/space limitations, and theorems relating the relative power of control structures under several notions of equivalence. In conclusion, the impact of theoretical results on the practicing programmer and the importance of one-in, one-out control structures as operational abstractions are discussed. It is argued further that there is insufficient evidence to warrant more than if-then-else, while-do, and their variants. [ABSTRACT FROM AUTHOR]
- Published
- 1975
- Full Text
- View/download PDF
32. On the Time Required for a Sequence of Matrix Products.
- Author
-
Muraoka, Yoichi, Kuck, David J., and Gries, D.
- Subjects
- *
PARALLEL computers , *COMPUTER algorithms , *MATRICES software , *COMPUTERS , *COMPUTER programming , *COMPUTER science - Abstract
This paper discusses the multiplication of conformable sequences of row vectors, column vectors, and square matrices. The minimum time required to evaluate such products on ordinary serial computers as well as parallel computers is discussed. Algorithms are presented which properly parse suck matrix sequences subject to the constraints of the machine organization. [ABSTRACT FROM AUTHOR]
- Published
- 1973
- Full Text
- View/download PDF
33. Interference Between Communicating Parallel Processes.
- Author
-
Gilbert, Philip, Chandler, W. J., and Randell, B.
- Subjects
- *
PARALLEL processing , *ELECTRONIC data processing , *COMPUTER programming , *COMPUTER operating systems , *SUPERCOMPUTERS , *COMPUTER science - Abstract
Various kinds of interference between communicating parallel processes have been examined by Dijkstra, Knuth and others. Solutions have been given for the mutual exclusion problem and associated subproblems, in the form of parallel programs, and informal proofs of correctness have been given for these solutions. In this paper a system of parallel processes is regarded as a machine which proceeds from one state S (i.e. a collection of pertinent data values and process configurations) to a next state 5' in accordance with a transition rule S ⇒ S . A set of such rules yields sequences of states, which dictate the system's behavior. The mutual exclusion problem and the associated subproblems are formulated as questions of inclusion between sets of states, or of the existence of certain sequences. A mechanical proof procedure is shown, which will either verify (prove the correctness of) or discredit (prove the incorrectness of) an attempted solution, with respect to any of the interference properties. It is shown how to calculate transition rules from the "partial rules" by which the individual processes operate. The formation of partial rules and the calculation of transition rules are both applicable to hardware processes as well as to software processes, and symmetry between processes is not required. [ABSTRACT FROM AUTHOR]
- Published
- 1972
- Full Text
- View/download PDF
34. A Technique for Software Module Specification with Examples.
- Author
-
Parnas, D. L.
- Subjects
- *
COMPUTER software , *TEACHING machines , *COMPUTER systems , *COMPUTER programming , *COMPUTER science , *ELECTRONIC data processing - Abstract
This paper presents an approach to writing specifications for parts of software systems. The main goal is to provide specifications sufficiently precise and complete that other pieces of software can be written to interact with the piece specified without additional information. The secondary goal is to include in the specification no more information than necessary to meet the first goal. The technique is illustrated by means of a variety of examples from a tutorial system. [ABSTRACT FROM AUTHOR]
- Published
- 1972
- Full Text
- View/download PDF
35. An Axiomatic Basis for Computer Programming.
- Author
-
Hoare, C. A. R.
- Subjects
- *
COMPUTER software , *COMPUTER programming , *COMPUTER logic , *PROGRAMMING languages , *COMPUTER science - Abstract
In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which con be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and practical, may follow from a pursuance of these topics. [ABSTRACT FROM AUTHOR]
- Published
- 1969
- Full Text
- View/download PDF
36. The Role of Programming in a Ph.D. Computer Science Program.
- Author
-
Arden, Bruce W. and Calingaert, P.
- Subjects
- *
COMPUTER programming , *GRADUATE education , *SUBJECT cataloging , *BIBLIOGRAPHY , *COMPUTER training , *COMPUTER science - Abstract
In this general paper the role of programming in advanced graduate training is discussed. Subject matter related to programming as well as programming per se is considered. The importance and application of formalism are considered and also the need for good empirical experimentation. A brief outline for a sequence of courses is included, and subject headings that have been obtained from an extensive bibliography are given. A bibliography of programming references is included. [ABSTRACT FROM AUTHOR]
- Published
- 1969
- Full Text
- View/download PDF
37. The Emergence of a Profession.
- Author
-
Orden, Alex and Calingaert, P.
- Subjects
- *
COMPUTER programming , *PROFESSIONAL employees , *PROFESSIONS , *COMPUTER programmers , *PROGRAMMING languages , *COMPUTER science - Abstract
Computer programming deals with an enormous variety of activities and is carried on by people with a great variety of backgrounds. It seems clear that part but not all of this activity h evolving toward a distinct professional field, but that the scope of this emerging profession, and some of its economic, social, and educational characteristics are as yet by no means well defined. In this paper, these issues are examined and some opinions about them are expressed. [ABSTRACT FROM AUTHOR]
- Published
- 1967
- Full Text
- View/download PDF
38. Present Status And Tendencies In Docking Systems' Development.
- Author
-
Felski, Andrzej, Naus, Krzysztof, Świerczyński, Sławomir, Wąż, Mariusz, and Zwolan, Piotr
- Subjects
- *
SYSTEMS development , *COMPUTER science , *COMPUTER programming , *DOCKING stations (Electronics) , *COMPUTER architecture - Abstract
The process of the ships docking, especially very large ships, is an very risky operation in confined and busy port waters. The similar difficult is the task to pass along any channel, river, strait or similar water road. The basic difficulty causes maneuvering with the great mass of the ship in situation of small space to maneuvers, the large inertia of the object and poor maneuvering properties at small speeds occurring in such circumstances. An additional factor, which make this task more difficult is the influence of the wind and the sea current on the hull of the inert ship as well as consequences of the limited visibility. The bad weather can cause the necessity to delay the maneuver. However this joins with heavy costs. An alternative is usage of systems supporting this process. In this paper nowadays accessible systems for augmentation the docking and harbor navigation are analysed. There are: shore based (active or passive) and ship based (active). This paper is prepared in the frame of Bonus project call 2012 'The Captain Assistant system for Navigation and Routing during Operations in Harbor'. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
39. WHY TEACH ROBOTICS USING ROS?
- Author
-
Michieletto, Stefano, Ghidoni, Stefano, Pagello, Enrico, Moro, Michele, and Menegatti, Emanuele
- Subjects
- *
ROBOTICS in education , *COMPUTER science , *COMPUTER engineering , *COMPUTER programming , *COMPUTER software - Abstract
This paper focuses on the key role played by the adoption of a framework in teaching robotics with a computer science approach in the master in Computer Engineering. The framework adopted is the Robot Operating System (ROS), which is becoming a standard de facto inside the robotics community. The educational activities proposed in this paper are based on a constructionist approach. The Mindstorms NXT robot kit is adopted to trigger the learning challenge. The ROS framework is exploited to drive the students programming methodology during the laboratory activities and to allow students to exercise with the major computer programming paradigms and the best programming practices. The major robotics topics students are involved with are: acquiring data from sensors, connecting sensors to the robot, and navigate the robot to reach the final goal. The positive effects given by this approach are highlighted in this paper by comparing the work recently produced by students with the work produced in the previous years in which ROS was not yet adopted and many different software tools and languages were used. The results of a questionnaire are reported showing that we achieved the didactical objectives we expected as instructors. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
40. Gamifying Computer Science Education for Z Generation.
- Author
-
Jawad, Hadeel Mohammed and Tout, Samir
- Subjects
- *
COMPUTER science education , *GENERATION Z , *COMPUTER programming , *COMPUTER science , *TEACHING methods , *SMART devices - Abstract
Generation Z members use their smart devices as part of their everyday routine. Teaching methods may need to be updated to make learning materials more interesting for this generation. This paper suggests gamifying computer science subjects to enhance the learning experience for this generation. Additionally, many students face difficulty in understanding computer science materials and algorithms. Gamifying computer science education is one of the suggested teaching methods to simplify topics and increase students' engagement. Moreover, the field of computer science is dominated by males. The use of gamification could increase women's interest in this field. This paper demonstrates different techniques that were developed by the researchers to employ gamification in teaching computer science topics. The data was collected at the end of the two different courses. Results show that students enjoyed the suggested teaching method and found it useful. This paper also demonstrates two tools and their gamification elements. These tools were developed by the researchers to help people learn computer programming and information security. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
41. Collaborative gaming and competition for CS-STEM education using SPHERES Zero Robotics
- Author
-
Nag, Sreeja, Katz, Jacob G., and Saenz-Otero, Alvar
- Subjects
- *
SPACE robotics , *COMPUTER science , *COMPUTER programming , *ARTIFICIAL satellites , *SYSTEMS design , *TOURNAMENTS - Abstract
Abstract: There is widespread investment of resources in the fields of Computer Science, Science, Technology, Engineering, Mathematics (CS-STEM) education to improve STEM interests and skills. This paper addresses the goal of revolutionizing student education using collaborative gaming and competition, both in virtual simulation environments and on real hardware in space. The concept is demonstrated using the SPHERES Zero Robotics (ZR) Program which is a robotics programming competition. The robots are miniature satellites called SPHERES—an experimental test bed developed by the MIT SSL on the International Space Station (ISS) to test navigation, formation flight and control algorithms in microgravity. The participants compete to win a technically challenging game by programming their strategies into the SPHERES satellites, completely from a web browser. The programs are demonstrated in simulation, on ground hardware and then in a final competition when an astronaut runs the student software aboard the ISS. ZR had a pilot event in 2009 with 10 High School (HS) students, a nationwide pilot tournament in 2010 with over 200 HS students from 19 US states, a summer tournament in 2010 with ∼150 middle school students and an open-registration tournament in 2011 with over 1000 HS students from USA and Europe. The influence of collaboration was investigated by (1) building new web infrastructure and an Integrated Development Environment where intensive inter-participant collaboration is possible, (2) designing and programming a game to solve a relevant formation flight problem, collaborative in nature—and (3) structuring a tournament such that inter-team collaboration is mandated. This paper introduces the ZR web tools, assesses the educational value delivered by the program using space and games and evaluates the utility of collaborative gaming within this framework. There were three types of collaborations as variables—within matches (to achieve game objectives), inter-team alliances and unstructured communication on online forums. Simulation competition scores, website usage statistics and post-competition surveys are used to evaluate educational impact and the effect of collaboration. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF
42. Exploring software security approaches in software development lifecycle: A systematic mapping study.
- Author
-
Mohammed, Nabil M., Niazi, Mahmood, Alshayeb, Mohammad, and Mahmood, Sajjad
- Subjects
- *
COMPUTER software security , *COMPUTER software development , *UNIFIED modeling language , *COMPUTER programming , *COMPUTER science - Abstract
There is an increase use of security driven approaches to support software development activities, such as requirements, design and implementation. The objective of this paper is to identify the existing software security approaches used in the software development lifecycle (SDLC). In order to meet our goal, we conducted a systematic mapping study to identify the primary studies on the use of software security techniques in SDLC. In total, we selected and categorized 118 primary studies. After analyzing the selected studies, we identified 52 security approaches and we categorized them in to five main categories, namely, ‘secure requirements modeling’, ‘vulnerability identification, adaption and mitigation’, ‘software security focused process’, ‘extended UML-based secure modeling profiles’, ‘non UML-based secure modeling notations’. The results show that the most frequently used approaches are static analysis and dynamic analysis that provide security checks in the coding phase. In addition, our results show that many studies in this review considered security checks around the coding stage of software development. This work will assist software development organizations in better understanding the existing software security approaches used in the software development lifecycle. It can also provide researchers with a firm basis on which to develop new software security approaches. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
43. An IoT and Wearable Technology Hackathon for Promoting Careers in Computer Science.
- Author
-
Byrne, Jake Rowan, O'Sullivan, Katriona, and Sullivan, Kevin
- Subjects
- *
STOCHASTIC learning models , *CONSTRUCTIVISM (Education) , *COMPUTER science , *COMPUTER programming , *INTERNET of things - Abstract
This paper explores the use of a constructivist 21st-century learning model to implement a week-long workshop, delivered as a “hackathon,” to encourage preuniversity teenagers to pursue careers in STEM, with a particular emphasis on computer science. For Irish preuniversity students, their experience of computing can vary from word processing to foundational programming, and while many schools are looking to introduce more ICT into the classroom, many students are left with a narrow view of what computer science is all about. Twenty-one students participated in the workshop and completed pre- and post-surveys, and a free word association exercise in the areas of computing and careers in computing. Analysis revealed that students’ motivation to learn about the design process, programming, inputs and outputs, and wearable technology (wearables)/Internet of Things (IoT) increased following participation. There were also increases in confidence in inputs and outputs and wearables/IoT following participation, as well as changes in the computing word associations, with students associating computing more with computer programming terms rather than general terms such as the Internet. The findings suggest that the combination of a hackathon event and a model for 21st century learning can be effective in motivating and increasing the self-efficacy of preuniversity teenagers in a number of emerging technological contexts such as IoT and wearables. [ABSTRACT FROM PUBLISHER]
- Published
- 2017
- Full Text
- View/download PDF
44. Effective support of databases with ontological dependencies: Relational languages instead of description logics.
- Author
-
Kalinichenko, L.
- Subjects
- *
DATABASES , *ONTOLOGY , *COMPUTER science , *DESCRIPTION logics , *LANGUAGE & languages , *COMPUTER programming , *APPLICATION software - Abstract
The paper provides a brief survey of the languages for efficient support of access to the databases satisfying the ontological dependencies. The first part of the paper retraces the development of description logics intended for application in the database and information systems context, as well as experimental results of building of the 'ontologically based' data access systems. The main part of the paper is devoted to the survey of the development of relational database languages providing broader and more efficient support of queries over databases with the ontological dependencies compared to the description logics. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
45. A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity.
- Author
-
Jain, Rahul, Pereszlényi, Attila, and Yao, Penghui
- Subjects
- *
COMMUNICATION complexity (Information theory) , *ELECTRONIC data processing , *COMPUTER science , *COMPUTER programming , *COMPUTATIONAL complexity - Abstract
A strong direct product theorem for a problem in a given model of computation states that, in order to compute k instances of the problem, if we provide resource which is less than k times the resource required for computing one instance of the problem with constant success probability, then the probability of correctly computing all the k instances together, is exponentially small in k. In this paper, we consider the model of two-party bounded-round public-coin randomized communication complexity. We show a direct product theorem for the communication complexity of any complete relation in this model. In particular, our result implies a strong direct product theorem for the two-party constant-round public-coin randomized communication complexity of all complete relations. As an immediate application of our result, we get a strong direct product theorem for the pointer chasing problem. This problem has been well studied for understanding round v/s communication trade-offs in both classical and quantum communication protocols. Our result generalizes the result of Jain which can be regarded as the special case when the number of messages is one. Our result can be considered as an important progress towards settling the strong direct product conjecture for two-party public-coin communication complexity, a major open question in this area. We show our result using information theoretic arguments. Our arguments and techniques build on the ones used by Jain. One key tool used in our work and also by Jain is a message compression technique due to Braverman and Rao, who used it to show a direct sum theorem in the same model of communication complexity as considered by us. Another important tool that we use is a correlated sampling protocol which, for example, has been used by Holenstein for proving a parallel repetition theorem for two-prover games. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
46. Closed world specialisation inside the induction process.
- Author
-
Drole, Miha and Kononenko, Igor
- Subjects
- *
LOGIC programming , *COMPUTER programming , *INDUCTIVE logic programming , *COMPUTER science , *BIG data - Abstract
This paper explores the idea of closed world specialisation (CWS). While traditional CWS is performed as a postprocessing step, we propose two different approaches to incorporating it into the induction process of a bottom-up inductive logic programming system. The motivation comes from the fact that using CWS as a postprocessing step is incapable of solving problems in which the negated part of the hypothesis is crucial. We apply the proposed approaches to the ProGolem bottom-up ILP system. We give examples of problems, where classical CWS fails to find a complete and consistent solution, whereas the proposed approaches succeed. Tests on real-world datasets show that the proposed approaches perform at least as well as regular CWS, while being better in terms of predictive accuracy in some cases. We also point out some weaknesses of different CWS approaches. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
47. The Issue of (Software) Plagiarism: A Student View.
- Author
-
Chuda, Daniela, Navrat, Pavol, Kovacova, Bianka, and Humay, Pavel
- Subjects
- *
PLAGIARISM , *COMPUTER software , *PSYCHOLOGY of college students , *EDUCATION , *COMPUTER programming , *SOCIOCULTURAL factors , *INFORMATION technology - Abstract
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 PUBLISHER]
- Published
- 2012
- Full Text
- View/download PDF
48. John von Neumann's Analysis of Gaussian Elimination and the Origins of Modern Numerical Analysis.
- Author
-
Grcar, Joseph F.
- Subjects
- *
COMPUTERS , *MATHEMATICAL analysis , *NUMERICAL analysis , *COMPUTER science - Abstract
Just when modern computers (digital, electronic, and programmable) were being invented, John von Neumann and Herman Goldstine wrote a paper to illustrate the mathematical analyses that they believed would be needed to use the new machines effectively and to guide the development of still faster computers. Their foresight and the congruence of historical events made their work the first modern paper in numerical analysis. Von Neumann once remarked that to found a mathematical theory one had to prove the first theorem, which he and Goldstine did for the accuracy of mechanized Gaussian elimination--but their paper was about more than that. Von Neumann and Goldstine described what they surmised would be the significant questions once computers became available for computational science, and they suggested enduring ways to answer them. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
49. Digital learning, digital scholarship and design thinking
- Author
-
Burdick, Anne and Willis, Holly
- Subjects
- *
DIGITAL learning , *SCHOLARLY method , *DESIGN & technology , *DESIGN , *DIGITAL technology , *COMPUTER science , *COMPUTER programming , *DIGITAL humanities centers , *EDUCATIONAL technology , *DIGITAL communications , *DIGITAL electronics - Abstract
This paper identifies opportunities for design thinking to be integrated into digital learning and digital scholarship initiatives. The paper traces how the rise of digital culture has led to the reconsideration of models for learning and the call for new modes of knowledge production, spearheaded by an array of fields from writing programs to computer science. Drawing upon case studies from new media education and the digital humanities, the paper argues that design thinking that is situated, interpretive, and user-oriented is well suited to these initiatives. The paper concludes with a call for design thinking research to engage with emerging models for learning and knowledge production, work whose effects could be felt at an epistemic level for generations. [Copyright &y& Elsevier]
- Published
- 2011
- Full Text
- View/download PDF
50. Autonomic management of application workflows on hybrid computing infrastructure.
- Author
-
Brandic, Ivona, Raicu, Ioan, Kim, Hyunjoo, el-Khamra, Yaakoub, Rodero, Ivan, Jha, Shantenu, and Parashar, Manish
- Subjects
- *
WORKFLOW , *CLOUD computing , *COMPUTER programming , *COMPUTER science , *COMPUTER systems - Abstract
In this paper, we present a programming and runtime framework that enables the autonomic management of complex application workflows on hybrid computing infrastructures. The framework is designed to address system and application heterogeneity and dynamics to ensure that application objectives and constraints are satisfied. The need for such autonomic system and application management is becoming critical as computing infrastructures become increasingly heterogeneous, integrating different classes of resources from high-end HPC systems to commodity clusters and clouds. For example, the framework presented in this paper can be used to provision the appropriate mix of resources based on application requirements and constraints. The framework also monitors the system/application state and adapts the application and/or resources to respond to changing requirements or environment. To demonstrate the operation of the framework and to evaluate its ability, we employ a workflow used to characterize an oil reservoir executing on a hybrid infrastructure composed of TeraGrid nodes and Amazon EC2 instances of various types. Specifically, we show how different applications objectives such as acceleration, conservation and resilience can be effectively achieved while satisfying deadline and budget constraints, using an appropriate mix of dynamically provisioned resources. Our evaluations also demonstrate that public clouds can be used to complement and reinforce the scheduling and usage of traditional high performance computing infrastructure. [ABSTRACT FROM AUTHOR]
- Published
- 2011
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.