This article describes progress towards a conjecture of S.W. Graham. He conjectured that the number C-3(X) of Carmichael numbers up to X with three prime factors is <=root X for all X >= 1. He showed that his conjecture is true for X <= 10(16) and X>10(126). In this article, it is shown that the conjecture is true for X <= 10(24) and X > 2 * 10(40). In both cases, analytical methods establish the conjecture for large X and tables of Carmichael numbers are used for small X. (c) 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

Routing Protocol for Low power and Lossy network (RPL) offers a set of mechanisms to attain efficient communication over resource-limited heterogeneous IoT environments. RPL attacks downgrade the network performance by disrupting the optimal protocol structure. So it is crucial to develop lightweight security solutions to detect such attacks and maximize the RPL performance. This paper designs an intelligent and lightweight IDS model named RPL Attacks based on Intrusion Detection for Efficient Routing (RAIDER) to reinforce security of RPL routing mechanism. RAIDER addresses the lack of security over RPL by analyzing the impacts of four RPL attacks using simulation, incorporates an automata theory with the IDS nodes to scrutinize the node behavior and to diminish the impact of such attacks. The IDS nodes monitor the network and periodically transplant the observed information as different states based on the finite automata theory. RAIDAR takes attack decisions based on the state transitions pre-estimated threshold of context-aware attack decision-making model and detects RPL attacks. RAIDER improves the RPL routing performance with minimum energy consumption. The Contiki Cooja-based simulation results demonstrate the efficiency of the RAIDER in terms of the packet delivery ratio, energy consumption, delay, overhead, attack detection accuracy, and network lifetime.

This book is about learning to program while solving puzzles. The motivation for the author to use this approach is to gain better attention from students, many of whom do not like to program just for the sake of programming. As mentioned in the informative preface, this book reflects the author's "attempt at teaching programming by building a bridge between the recreational world of algorithmic puzzles and the pragmatic world of computer programming," because the same analytical skills required for puzzle solving are also needed for "translating specifications into programming constructs, as well as discovering errors in early versions of code, called the debugging process."

This book is about algorithms and their enormous influence on people in the current age. Algorithms are precise sets of rules to solve problems. They are ubiquitous and have a great effect on the lives of contemporary people, primarily due to technological advancement. A common example is searching for information using an Internet search engine such as Google. This book is not technical in nature and was first published in French as Le Temps des Algorithmes, by ´ Editions Le Pommier in 2020. The authors Serge Abiteboul and Gilles Dowek are computer scientists, with Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt and ´ Ecole Normale Sup´erieure, Paris respectively. They believe that algorithms have made life easier, nevertheless, they dread that algorithms may subjugate humans. This book is intended to serve as an eye-opener on the impact of algorithms on daily life.

This book is on algorithms for network flows. Network flow problems are optimization problems where given a flow network, the aim is to construct a flow that respects the capacity constraints of the edges of the network, so that incoming flow equals the outgoing flow for all vertices of the network except designated vertices known as the source and the sink. Network flow algorithms solve many real-world problems. This book is intended to serve graduate students and as a reference. The book is also available in eBook (ISBN 9781316952894/US$ 32.00), and hardback (ISBN 9781107185890/US$99.99) formats. The book has a companion web site www.networkflowalgs.com where a pre-publication version of the book can be downloaded gratis.

The data dissemination toward the sink node in a wireless sensor network in one of three ways: single-hop data dissemination, multi-hop dissemination, and multi-hop dissemination, using the nearest cluster head or sector head (SH). This study focuses on third multi-hop data dissemination in which SHs are selected in the network, other nodes disseminate data toward these SHs, and then, the SHs transfer the collected data to the sink node. This paper proposes a novel approach to SH selection called Energy-Efficient Reliable Sectoring-Scheme (EERSS). It is supported by an optimization algorithm called Cat Swarm Optimization (CSO), which proves that the elected number of SH is optimal. This CSO based EERSS algorithm is implemented to rank quality of service parameters, such as network lifetime maximization, with reliability and to minimize energy consumption. A path reliability prediction-based Markov chain model is applied to the CSO-based-EERSS algorithm to achieve results that are superior to that of traditional models. After the construction of the proposed prediction algorithms CSO-based-EERSS (P-CSO-EERSS), its performance is compared with that of the traditional CSO-based-EERSS, EERSS, and Particle Swarm Optimization based EERSS, concerning packet delivery ratio(PDR), end-to-end delay, and energy consumption. The SH selection performance of the proposed P-CSO-EERSS is superior to that of the traditional algorithms based on low energy consumption and high PDR.

The maintaining of the Quality of Service(QoS) parameter in wireless sensor networks (WSN) is becoming a challenging task. The limitations are like achieving QoS parameters in a distributed network, constraints in sensing parameters, natural disasters, and battery life of sensor nodes need to overcome. Here in this paper few of the QoS parameters are analysed to increase the lifetime of sensor networks by partitioning a network into various sectors. A novel optimized sectoring scheme is proposed for optimal election of sector head (SH) for a given network. A Cat Swarm Optimization based Energy-Efficient Reliable sectoring Scheme with prediction algorithms (P-CSO-EERSS) is also proposed in this paper. The use of prediction algorithms is for early detection of node lifetime to improve the overall lifespan of a network. Along with this QoS parameters such as packet delivery ratio and energy consumption are analysed and compared with existing clustering algorithms. According to implementation results, it has been shown that the prediction based CSO-EERSS algorithm returns better QoS parameters as compare to existing cluster schemes.

The motivation for this article is to understand future job requirements in the field of computer science and related fields. It is obvious that emerging technologies will necessitate new skills and roles. Technology powers the economy, allows businesses to prosper and creates jobs. In earlier years, the focus of the IT industry was primarily on programming. Strong programming skills are still needed but industries wish to select students skilled in technologies when they recruit them from institutions imparting engineering education. It is necessary to understand which disruptive technologies in fields related to computer science and engineering are going to shape future jobs.

Nowadays, supply has to be matched with demand for various types of goods and services. For designing real-world markets, the study of market design becomes essential, which is the focus of this book. The book comprises four parts and consists of twelve chapters. A brief introductory chapter provides an outline of the book. The first part focuses on microeconomic fundamentals. The second part is on multi-object auction design. The third part looks at approximation and matching markets. The fourth part has appendices on linear optimization, and algorithms and complexity At the end of the book, there are references to the literature and a helpful index. Many chapters include questions for comprehension and problems for practice. The book is intended to be a textbook for a single semester course on market design. The prerequisites for the book include familiarity with linear programming, integer linear programming, rudimentary calculus and probability theory. The intended audience comprises students with backgrounds in computer science, information systems, mathematics, and management science. The book is available in hardcover and eBook formats. The ISBN/price are 9781107173187 / US $ 64.99 and 9781316805350 / US $ 52 for the hardback and eBook respectively.

The rapid development of Information and Communication Technology and the growing number of devices connected to the Internet make the Internet of Things (IoT) as a promising technology for a new breed of applications. The Routing Protocol for Low-Power and Lossy Networks (RPL) is a widely applied open standard protocol for IoT networks. The RPL routing is highly vulnerable to routing attacks due to the constrained nodes. The attacks on the RPL aim to disrupt the optimal protocol structure and significantly deteriorating network performance. Secure RPL routing schemes attempt to derive a high-level abstract of RPL operations through network simulation traces and apply it as a reference to differentiate the malicious behavior. The RPL specifications include all the states and transitions with its corresponding statistics. However, the malicious activities around a node enforce it to initiate the unnecessary state transition, and thus, the legitimate nodes are equally treated as malicious in dynamic IoT network scenarios. Hence, this work proposes a game theoretic model based anomaly Intrusion Detection System (IDS) to detect the RPL attacks and verify and confirm their malicious activities. This study formulates the Game models based Anomaly Intrusion Detection System (GAIDS) for RPL security. The proposed approach consists of two interrelated formulations, such as a stochastic game for attack detection and evolutionary game for attack confirmation. The stochastic game model formulates the activities of the standard RPL rules as a zero-sum stochastic game. The stochastic game estimates the payoff by observing the states, transitions between them, and their statistics. However, there is a possibility to model legitimate players as malicious, due to the nature of RPL. Thus, the proposed GAIDS scheme implements the evolutionary game theoretic framework on clustered network topology for the attack verification. By synchronizing the results of the stochastic game of neighboring players, it differentiates the legitimate players from the suspected list successfully. As a result, the GAIDS isolates the detected attackers and maintains the routing performance. The simulation results demonstrate that the detection accuracy and throughput of the proposed gaming model based anomaly IDS is substantially high and outperforms the existing scheme.

Codes, cryptology and curves are widely used today for secure as well as reliable communication. This book aims to introduce these topics to students of computer science, mathematics and physics at the masters level. It also looks at the application of computer algebra for solving related problems. It consists of twelve chapters contributed by four authors and published by Cambridge University Press. The book is also available in hardback and e-book formats, the price/ISBN being US$160/9780521817110, and US$52/9781108547826, respectively.

Internet of things is a new paradigm that connects the internet to the physical objects of different domain viz. home automation, human health services, and industrial process automation and environmental monitoring. It is deeply presented in our daily activities through various devices. The devices connected with the internet bring many benefits but simultaneously bringing the security issues also. For protecting the network and information systems the intrusion detection system is an important tool. However traditional techniques used for intrusion detection are not sufficient to protect the network consists of specific characteristics like constraint resourced devices and specific protocol stacks. In this paper, we proposed an intrusion detection system for RPL (Routing Protocol for Low power and lossy networks) which is focused on WSN and constrained resources. Proposed IDS follows detection of an attack, IDS placement strategy, and validation process.

Recently, the evolving technologies in wireless communication demand the integration of Wireless Sensor Network (WSN) with the Internet of Things (IoT). The IoT exploits the standard Internet Protocol (IP) to connect smart sensors worldwide and utilizes the sensed data in various functions such as identification, location, tracking, monitoring, and so on. Several attacks are characterized by IoT in the routing criteria. Hence analysis should be held to reduce those attacks for improving the performance. In this survey, various applications of IoT routing and performance measures of security with the tools available to implement IoT environment is presented. This paper also surveys various routing attacks and focuses on defense mechanisms in brief.

Video games provide entertainment to those who play them. This book looks at the hidden mathematics behind video games. It is meant for all those who love playing video games, so that they may explore mathematical ideas in the games. It is also aimed at mathematics teachers for inspiring their students, and for all those who love mathematics and games. Even those who hate mathematics but love video games are also a part of the target audience of this book. However, this particular category of readers needs at least some familiarity with high school mathematics to benefit from the book. The author states that many people enjoy playing computer / video games but few would be indulging themselves in doing some math. He terms this a consequence of poor marketing of mathematics since time immemorial. The main purpose of the book is to highlight that mathematics can be fun and that it can be found even in the most unbelievable or unexpected places such as in computer games.

Social choice theory is an area of economics that studies collective decision making. Examples of collective decision making include sharing a cake or a resource among a group of people or friends, tallying votes in an election, and aggregating opinions of various experts. Computational social choice is a discipline which may be considered to be at the intersection of economics and computer science. This book deals with recent trends related to computational aspects of collective decision making. It contains contributions of experts in computational social choice. The book is divided into three parts that focus on scenarios, techniques, and applications, respectively. It has been published as a sequel to the Handbook of Computational Social Choice, Cambridge University Press, 2016, recently reviewed by me in this column (SIGACT News 48(4), December 2017, pp. 13-17). Ulle Endriss, the editor of this book, was also an editor of the Handbook. This book has been published by AI Access, a not-for-profit publisher. It is available for free online at the URL http://research.illc.uva.nl/COST-IC1205/Book/, and the hard copy is very nominally priced. The book's publication

Video games provide entertainment to those who play them. This book looks at the hidden mathematics behind video games. It is meant for all those who love playing video games, so that they may explore mathematical ideas in the games. It is also aimed at mathematics teachers for inspiring their students, and for all those who love mathematics and games. Even those who hate mathematics but love video games are also a part of the target audience of this book. However, this particular category of readers needs at least some familiarity with high school mathematics to benefit from the book. The author states that many people enjoy playing computer / video games but few would be indulging themselves in doing some math. He terms this a consequence of poor marketing of mathematics since time immemorial. The main purpose of the book is to highlight that mathematics can be fun and that it can be found even in the most unbelievable or unexpected places such as in computer games.

Social choice theory is an area of economics that studies collective decision making. It provides mathematical models and guidelines for making the right choices. Examples of collective decision making include sharing a cake among friends and voting in an election. Computational social choice is a discipline which may be considered to be at the crossroads of economics and computer science. This handbook on computational social choice deals with the computational aspects of collective decision making. It contains contributions from thirty-six eminent researchers in the field of computational social choice. The key areas covered by the book are voting, fair allocation of divisible as well as indivisible goods, coalition formation, and miscellaneous topics such as judgement aggregation and knockout tournaments. The book is available in hardcover and Adobe eBook Reader formats. The ISBNs are 9781107060432 (hardcover) and 9781316490631 (ebook). They are priced at US $59.99 and US $48, respectively.

review-article Share on Review of Algebraic Coding Theory Revised Edition by Elwyn Berlekamp Reviewer: S. V. Nagaraj VIT University, Chennai Campus, India VIT University, Chennai Campus, IndiaView Profile Authors Info & Claims ACM SIGACT NewsVolume 48Issue 1March 2017 pp 23–26https://doi.org/10.1145/3061640.3061645Published:10 March 2017Publication History 0citation130DownloadsMetricsTotal Citations0Total Downloads130Last 12 Months21Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access