scholarly journals FROM BOOLE’S LOGIC TO BOOLEAN APPLICATIONS IN COMPUTER SCIENCE

2021 ◽  
pp. 18-25
Author(s):  
Mohamad Awwad
Keyword(s):  
Computer Science ◽  
19Th Century ◽  
Boolean Logic ◽  
Combinational Circuits ◽  
Logical Language ◽  
Theoretical Perspectives ◽  
Modern Cryptography

The developments of an algebraic logical language of thoughts by G. Boole are considered using historical and theoretical perspectives. The technical implementations of Boolean logic in combinational circuits and in modern cryptography show strong influences of a 19th century logic on the latest technologies of computing.

Noncooperative Game Theory

2017 ◽  
Author(s):  
João P. Hespanha
Keyword(s):  
Game Theory ◽  
Computer Science ◽  
Dynamic Games ◽  
Design Methodology ◽  
Noncooperative Game ◽  
Noncooperative Game Theory ◽  
Original Design ◽  
Theoretical Perspectives ◽  
Engineering Designs ◽  
Zero Sum

This book is aimed at students interested in using game theory as a design methodology for solving problems in engineering and computer science. The book shows that such design challenges can be analyzed through game theoretical perspectives that help to pinpoint each problem's essence: Who are the players? What are their goals? Will the solution to “the game” solve the original design problem? Using the fundamentals of game theory, the book explores these issues and more. The use of game theory in technology design is a recent development arising from the intrinsic limitations of classical optimization-based designs. In optimization, one attempts to find values for parameters that minimize suitably defined criteria—such as monetary cost, energy consumption, or heat generated. However, in most engineering applications, there is always some uncertainty as to how the selected parameters will affect the final objective. Through a sequential and easy-to-understand discussion, the book examines how to make sure that the selection leads to acceptable performance, even in the presence of uncertainty—the unforgiving variable that can wreck engineering designs. The book looks at such standard topics as zero-sum, non-zero-sum, and dynamic games and includes a MATLAB guide to coding. This book offers students a fresh way of approaching engineering and computer science applications.

Computational Aspects of Digital Steganography

2011 ◽  
pp. 193-211
Author(s):  
Maciej Liskiewicz ◽  
Ulrich Wölfel
Keyword(s):  
Computational Complexity ◽  
Computer Science ◽  
Formal Analysis ◽  
Point Of View ◽  
Secret Data ◽  
Secure Systems ◽  
Computational Aspects ◽  
Computational Resources ◽  
Modern Cryptography ◽  
Digital Steganography

This chapter provides an overview, based on current research, on theoretical aspects of digital steganography— a relatively new field of computer science that deals with hiding secret data in unsuspicious cover media. We focus on formal analysis of security of steganographic systems from a computational complexity point of view and provide models of secure systems that make realistic assumptions of limited computational resources of involved parties. This allows us to look at steganographic secrecy based on reasonable complexity assumptions similar to ones commonly accepted in modern cryptography. In this chapter we expand the analyses of stego-systems beyond security aspects, which practitioners find difficult to implement (if not impossible to realize), to the question why such systems are so difficult to implement and what makes these systems different from practically used ones.

Coding Across the Curriculum

2020 ◽  
pp. 214-227
Author(s):  
Janna Jackson Kellinger
Keyword(s):  
Computer Science ◽  
21St Century ◽  
Teacher Educators ◽  
Computational Thinking ◽  
Boolean Logic ◽  
Content Areas ◽  
Do So ◽  
Computer Programmer

This chapter explores why teacher educators should teach teachers how to integrate coding across content areas and how to do so by applying concepts of computational thinking such as using algorithms, flowcharts, and Boolean logic to all fields. Teaching teachers how to teach coding across the content areas offers opportunities to diversify people in a field where intimidation, discrimination, and lack of opportunities has effectively kept the field of programming largely white or Asian and male. In addition, as our lives become more and more infused with technology, Rushkoff warns that we either learn how to program or become programmed. This means that not everyone needs to become a computer programmer, but everyone needs to understand how programming computers works. In other words, coding across content areas would help prepare all students, not just those pursuing the field of computer science, for the 21st century.

The Graph Traversal Pattern

2011 ◽  
pp. 29-46 ◽  
Author(s):  
Marko A. Rodriguez ◽  
Peter Neubauer
Keyword(s):  
Computer Science ◽  
19Th Century ◽  
Relational Database ◽  
Relational Databases ◽  
Information Storage And Retrieval ◽  
Information Storage ◽  
Late 19Th Century ◽  
Data Management Systems ◽  
Storage And Retrieval ◽  
Graph Traversal

A graph is a structure composed of a set of vertices (i.e. nodes, dots) connected to one another by a set of edges (i.e. links, lines). The concept of a graph has been around since the late 19th century, however, only in recent decades has there been a strong resurgence in both theoretical and applied graph research in mathematics, physics, and computer science. In applied computing, since the late 1960s, the interlinked table structure of the relational database has been the predominant information storage and retrieval model. With the growth of graph/network-based data and the need to efficiently process such data, new data management systems have been developed. In contrast to the index-intensive, set-theoretic operations of relational databases, graph databases make use of index-free, local traversals. This chapter discusses the graph traversal pattern and its use in computing. (Angles & Guiterrez, 2008)

Following the Trail of eSports

2021 ◽  
pp. 440-461
Author(s):  
José Agustín Carrillo Vera ◽  
Juan Miguel Aguado Terrón ◽  
Salvador Gómez García
Keyword(s):  
Systematic Review ◽  
Literature Review ◽  
Computer Science ◽  
Scientific Production ◽  
Game Studies ◽  
Sport Science ◽  
Qualitative And Quantitative ◽  
Theoretical Perspectives ◽  
Average Profile ◽  
Quantitative Approaches

Despite eSports' relatively long history, the attention paid by academia to this phenomenon has been much more recent and is still in an embryonic state in all of the views. The scientific production has grown because of the global success associated with the widespread growth of live events and the large following of competitions retransmitted via streaming. This article aims to offer a literature review of the research carried out on eSports to date, based upon a systematic review on the sample of selected research. The results confirm the growing variety of approaches to the issue, but also a clear dominance of computer science perspectives rather than to sport science or game studies. While showing some balance between qualitative and quantitative approaches, the prevalence of theoretical perspectives may be taken as a sign of struggle for consolidation as a field. Finally, a discussion about main matters and an author and institution average profile are also provided.

scholarly journals Boolean Logic, Fregean Logic, Wittgensteinian Logic and the Processing of Natural Language

2021 ◽  
Author(s):  
Uyiosa Omoregie
Keyword(s):  
Natural Language ◽  
Computer Science ◽  
Language Processing ◽  
Predicate Logic ◽  
Ordinary Language ◽  
Boolean Logic ◽  
Modern Logic ◽  
Quantificational Logic ◽  
And Mathematics ◽  
New Formula

Gottlob Frege (1848-1925) transformed the field of logic from what it had remained since the days of Aristotle. Regarded as the founder of modern logic and much of modern philosophy, Frege laid the foundations of predicate logic, first-order predicate calculus and quantificational logic – formal systems central to computer science and mathematics. Frege was not satisfied with the ambiguity and imprecision of ordinary language. He created a new ‘formula language’ with elaborate symbols and definite rules, focused on conceptual content rather than rhetorical style, which he called Begriffsschrift – a formal language for 'pure thought'. Before Frege, George Boole (1815-1864) created what later became known as ‘Boolean logic’ which is fundamental to operations of computer science today. An application of Wittgensteinian logic could help filter authentic information from information disorder (non-information, off-information, mal-information and mis-information). Wittgensteinian logic applied in natural language processing technology (NLP), if possible and via automation, could transform the quality of information online. Many challenges remain.

Linked Ecologies: States and Universities as Environments for Professions

2005 ◽  
Vol 23 (3) ◽  
pp. 245-274 ◽  
Author(s):  
Andrew Abbott
Keyword(s):  
New York ◽  
Criminal Justice ◽  
Computer Science ◽  
19Th Century ◽  
Clinical Psychology ◽  
Ecological Theory ◽  
Applied Economics ◽  
Medical Licensing ◽  
Political Ecologies

In this article I generalize ecological theory by developing the notion of separate but linked ecologies. I characterize an ecology by its set of actors, its set of locations, and the relation it involves between these. I then develop two central concepts for the linkage of ecologies: hinges and avatars. The first are issues or strategies that “work” in both ecologies at once. The second are attempts to institutionalize in one ecology a copy or colony of an actor in another. The article investigates the first of these concepts using two detailed examples of hinge analysis between the professional and political ecologies. Both concern medical licensing, the first in 19th-century New York and the second in 19th-century England. For the avatar concept, the article analyzes four less detailed cases linking the professional and university ecologies: computer science, criminal justice, clinical psychology, and applied economics.

scholarly journals Preventing Shoulder-Surfing Attacks using Digraph Substitution Rules and Pass-Image Output Feedback

Symmetry ◽  
2019 ◽  
Vol 11 (9) ◽  
pp. 1087 ◽  
Author(s):  
Lip Yee Por ◽  
Chin Soon Ku ◽  
Tan Fong Ang
Keyword(s):  
Computer Science ◽  
Direct Observation ◽  
Output Feedback ◽  
User Study ◽  
New Method ◽  
Shoulder Surfing ◽  
Preliminary Study ◽  
Feedback Method ◽  
Modern Cryptography

In this paper, we focus on methods to prevent shoulder-surfing attacks. We initially adopted digraph substitution rules from PlayFair cipher as our proposed method. PlayFair cipher is a modern cryptography method, which exists at the intersection of the disciplines of mathematics and computer science. However, according to our preliminary study it was insufficient to prevent shoulder-surfing attacks. Thus, a new method had to be proposed. In this new proposed method, we improvised the digraph substitution rules and used these rules together with an output feedback method to determine a pass-image. Our proposed method was evaluated with a user study. The results showed our proposed method was robust against both direct observation and video-recorded shoulder-surfing attacks.

Aesthetica

2014 ◽  
Author(s):  
Subrata Dasgupta
Keyword(s):  
Computer Science ◽  
19Th Century ◽  
Major Part ◽  
Mathematical Reasoning ◽  
Computer Scientist ◽  
Programming Methodology ◽  
Computing Paradigm ◽  
Proof Construction ◽  
The 1960S ◽  
The University

In 1965, the Dutch computer scientist Edsger Dijkstra (1930–2002), then professor of mathematics at the Technische Universiteit Eindhoven (THE) in the Netherlands, wrote a paper titled “Programming Considered as a Human Activity” and thereby announced the birth of a movement to which he gave the name structured programming a few years later. Within the next 10 years, the movement would cause so much upheaval in the realm of programming, some came to call it a revolution—the structured programming revolution—and Dijkstra was viewed as its originator. The movement did not precipitate an overthrow of the stored-program computing paradigm as a whole, but insofar as designing and building soft ware systems was a major component of this paradigm, structured programming altered the very essence of the subparadigm in computer science that came to be called programming methodology. It brought about a new mentality concerning programming and its methodology. A major part of this mini-revolution actually occurred during the 1970s, but its foundations were laid during the second half of the 1960s by just a handful of publications. And Edsger Dijkstra was the revolutionary-in-chief. He laid out the gospel. Dijkstra’s undergraduate training was in mathematics and physics at the University of Leyden; he went on to obtain a PhD in computing in 1959 from the Mathematics Centrum in the University of Amsterdam and worked there until 1962 before accepting a chair in mathematics at the Technische Universiteit Eindhoven. As a computer scientist, mathematics was a source of inspiration for him, not only in terms of the method-of-proof construction, but also in the mathematician’s search for beauty in mathematical reasoning. He quoted 19th-century English logician and mathematician George Boole, who spoke of perfectness in mathematical reasoning not just in terms of efficiency, but also in whether a method exhibited “a certain unity and harmony.” And he tells us that contrary to the tacit assumption on the part of many that such aesthetic considerations as harmony and elegance were unaffordable luxuries in the hurly-burly world of programming, it actually paid to cultivate elegance. This became a mantra for him.

Sign in / Sign up

Export Citation Format

Share Document