Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
4,501
result(s) for
"Algorithms History."
Sort by:
The golden ticket : P, NP, and the search for the impossible
\"The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives.The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem\"-- Provided by publisher.
Book
On the Square Root Computation in Liber Abaci and De Practica Geometrie by Fibonacci
We study the square root computation by Leonardo Fibonacci (or Leonardo of Pisa) in his MSS Liber Abaci from c1202 and c1228 and De Practica Geometrie from c1220. In this MSS, Fibonacci systematically describes finding the integer part of the square root of an integer in numerous examples with three to seven decimal digits. The results of these examples are summarized in a table in the paper. Liber Abaci also describes in detail finding an approximation to the fractional part of the square root. However, in other examples in Liber Abaci and De Practica Geometrie, only the approximate values of the fractional part of the square roots are stated. This paper further explores these approximate values using techniques like reverse engineering. Contrary to many claims that Fibonacci also used other methods or approximations, we show that all examples can be explained using one digit-by-digit method to compute the integer part of the square root and one approximation scheme for the fractional part. Further, it is shown that the approximation scheme is tied to the method to compute the integer part of the square root.
Journal Article
Cross-Layer Optimization for Enhanced IoT Connectivity: A Novel Routing Protocol for Opportunistic Networks
Opportunistic networks, an evolution of mobile Ad Hoc networks (MANETs), offer decentralized communication without relying on preinstalled infrastructure, enabling nodes to route packets through different mobile nodes dynamically. However, due to the absence of complete paths and rapidly changing connectivity, routing in opportunistic networks presents unique challenges. This paper proposes a novel probabilistic routing model for opportunistic networks, leveraging nodes’ meeting probabilities to route packets towards their destinations. Thismodel dynamically builds routes based on the likelihood of encountering the destination node, considering factors such as the last meeting time and acknowledgment tables to manage network overload. Additionally, an efficient message detection scheme is introduced to alleviate high overhead by selectively deleting messages from buffers during congestion. Furthermore, the proposed model incorporates cross-layer optimization techniques, integrating optimization strategies across multiple protocol layers to maximize energy efficiency, adaptability, and message delivery reliability. Through extensive simulations, the effectiveness of the proposed model is demonstrated, showing improved message delivery probability while maintaining reasonable overhead and latency. This research contributes to the advancement of opportunistic networks, particularly in enhancing connectivity and efficiency for Internet of Things (IoT) applications deployed in challenging environments.
Journal Article
Language and the rise of the algorithm
\"A wide-ranging history of the intellectual developments that produced the modern idea of the algorithm. Bringing together the histories of mathematics, computer science, and linguistic thought, Language and the Rise of the Algorithm reveals how recent developments in artificial intelligence are reopening an issue that troubled mathematicians long before the computer age. How do you draw the line between computational rules and the complexities of making systems comprehensible to people? Here Jeffrey M. Binder offers a compelling tour of four visions of universal computation that addressed this issue in very different ways: G. W. Leibniz's calculus ratiocinator; a universal algebra scheme Nicolas de Condorcet designed during the French Revolution; George Boole's nineteenth-century logic system; and the early programming language ALGOL, whose name is short for algorithmic language. These episodes show that symbolic computation has repeatedly become entangled in debates about the nature of communication. To what extent can meaning be controlled by individuals, like the values of a and b in algebra, and to what extent is meaning inevitably social? By attending to this long-neglected question, we come to see that the modern idea of the algorithm is implicated in a long history of attempts to maintain a disciplinary boundary separating technical knowledge from the languages people speak day to day. Machine learning, in its increasing dependence on words, now places this boundary in jeopardy, making its stakes all the more urgent to understand. The idea of the algorithm is a levee holding back the social complexity of language, and it is about to break. This book is about the flood that inspired its construction. \"-- Provided by publisher.
BOOK
Optimization of History Tree in 3DR-Tree Index Structure
Many optimizations have been done to 3DR-tree index structure and many opinions have been proposed. Modification by splitting mechanism is one of them. There are two index trees in 3DR-tree index structure after modification: one is a history tree for past data storage and the other is an active tree for current data storage. In this article, optimization of history tree is firstly done and is proved theoretically. Then a correspondent insert algorithm is designed.
Journal Article
Programming pioneer Ada Lovelace
\"Have you ever wondered who developed computer coding? Discover how Ada Lovelace's interest in mathematics led to her work on an early computer and the first programming algorithm ever used\"--Provided by publisher.
Book
SciPy 1.0: fundamental algorithms for scientific computing in Python
SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages, over 100,000 dependent repositories and millions of downloads per year. In this work, we provide an overview of the capabilities and development practices of SciPy 1.0 and highlight some recent technical developments.
This Perspective describes the development and capabilities of SciPy 1.0, an open source scientific computing library for the Python programming language.
Journal Article
Dreaming in code : Ada Byron Lovelace, computer pioneer
\"This illuminating biography reveals how the daughter of Lord Byron, Britain's most infamous Romantic poet, became the world's first computer programmer\"-- Provided by publisher.
Book
Soil carbon debt of 12,000 years of human land use
Human appropriation of land for agriculture has greatly altered the terrestrial carbon balance, creating a large but uncertain carbon debt in soils. Estimating the size and spatial distribution of soil organic carbon (SOC) loss due to land use and land cover change has been difficult but is a critical step in understanding whether SOC sequestration can be an effective climate mitigation strategy. In this study, a machine learning-based model was fitted using a global compilation of SOC data and the History Database of the Global Environment (HYDE) land use data in combination with climatic, landform and lithology covariates. Model results compared favorably with a global compilation of paired plot studies. Projection of this model onto a world without agriculture indicated a global carbon debt due to agriculture of 133 Pg C for the top 2 m of soil, with the rate of loss increasing dramatically in the past 200 years. The HYDE classes “grazing” and “cropland” contributed nearly equally to the loss of SOC. There were higher percent SOC losses on cropland but since more than twice as much land is grazed, slightly higher total losses were found from grazing land. Important spatial patterns of SOC loss were found: Hotspots of SOC loss coincided with some major cropping regions as well as semiarid grazing regions, while other major agricultural zones showed small losses and even net gains in SOC. This analysis has demonstrated that there are identifiable regions which can be targeted for SOC restoration efforts.
Journal Article