Explore the vast range of titles available.

Following the success of I'm Your Man and Just Kids, legendary Canadian singer and songwriter Bruce Cockburn delivers his long-awaited memoir--a chronicle of faith, fear, and activism that is also a lively cultural and musical tour through the late twentieth century. Award-winning songwriter and pioneering guitarist Bruce Cockburn's life has been shaped by politics, protest, romance, and spiritual discovery. For more than five decades he has toured the globe, visiting far-flung places such as Guatemala, Mali, Mozambique, Afghanistan, and Nepal, performing and speaking out on diverse issues, from native rights and land mines to the environment and Third World debt. His journeys have been reflected in his music and evolving styles: folk, jazz, blues, rock, and worldbeat. Drawing from his experiences, he continues to create memorable songs about his ever-expanding universe of wonders. As an artist with thirty-one albums, Cockburn has won numerous awards and the devotion of legions of fans across America and his native Canada, where he is a household name. Yet the man himself has remained a mystery. In his memoir, Cockburn invites us into his private world, sharing his Christian convictions, his personal relationships, and the social and political activism that has defined him and has both invigorated and incited his fans.

The logarithmic number system (LNS) can be used to simplify the computation of arithmetic functions, such as multiplication. This article proposes three leading‐one detectors (LODs) to speed up the binary logarithm calculation in the LNS. The first LOD (LOD I) uses a single fixed value to approximate the d least significant bits (LSBs) in the outputs of the LOD. The second design (LOD II) partitions the d LSBs into smaller fields and uses a multiplexer to select the closest approximation to the exact value. These two LODs help with error cancellation as they introduce signed errors for inputs N < 2d. Additionally, a scaling scheme is proposed that scales up the input N < 2d to avoid large approximation errors. Finally, an improved exact LOD (LOD III) is proposed that only passes half of the input N to the LOD; the more significant half is passed if there is at least one ‘1’ in that half; otherwise, the less significant half is passed. Our simulation results show that the 32‐bit LOD III can be up to 2.8× more energy‐efficient than existing designs in the literature. The Mitchell logarithmic multiplier and a neural network are considered to further illustrate the practicality of the proposed designs.

A channel simulator is an essential component in the development and accurate performance evaluation of wireless systems. A key technique for producing statistically accurate fading variates is to shape the flat spectrum of Gaussian variates using digital filters. This paper addresses various challenges when designing real and complex spectrum shaping filters with quantized coefficients for efficient realization of both isotropic and nonisotropic fading channels. An iterative algorithm for designing stable complex infinite impulse response (IIR) filters with fixed-point coefficients is presented. The performance of the proposed filter design algorithm is verified with 16-bit fixed-point simulations of two example fading filters.

An Officer of the Order of Canada and the honorary chair of Friends of the Earth, Cockburn has used his music to oppose degradation of the environment - from destructive logging practices to the Exxon oil spill. \"Everything comes down to the human heart and how we treat each other,\" Cockburn told Alternatives editor-in-chief Nicola Ross when she interviewed him in advance of Earth Day Canada's 7h annual gala. [...] I had not been in a tropical rainforest, but I had been in the coastal rainforest in BC, and I had a sense of what it's like to be in an environment where the vegetation looms that large.

During the 1950s, 4 main areas of focus emerged. \"Hardware\" concentrated on the construction of reliable equipment with faster central-processing units (CPUs), larger memories and more input and output devices to solve increasingly ambitious problems.

Thatte and Abraham's functional fault model for $n$ x 1 random-access memories (RAMs) includes faults of three types, namely, stuck-at, transition, and (write-triggered) coupling faults. In this thesis, Brzozowski and Jurgensen's formalization of automaton testing is applied to characterize the problem of detecting coupling faults. A single coupling fault exists from cell i to cell k if, when cells i and k contain two particular binary values a and b, and $\\bar a$ is written to cell i, then the contents of cell k also change. A related fault is the single toggling fault, which exists if, when cell i contains a, and $\\bar a$ is written to cell i, then the contents of cell k are complemented. Various sets of faults, i.e., fault models, are identified on the basis of the growth rates of the corresponding tests. One hierarchy of fault models consists of general toggling, 2-limited toggling, and single toggling, which are, respectively, the sets of all single and multiple toggling faults, all single and double toggling faults, and all single toggling faults. GTTEST and STTEST, of lengths $2n\\sp2 + n$ and $5n - 2$, are shown to be optimal tests for detecting general and single toggling, respectively. A lower bound of $n\\ \\lfloor {\\rm log}\\sb2(n-1)\\rfloor + 5n$ is derived on the length of any test that detects 2-limited toggling; 2LTTEST, of length $4n\\ \\lceil {\\rm log}\\sb2n\\rceil + n$, is shown to detect this fault model. A second hierarchy, consisting analogously of general coupling, 2-limited coupling, and single coupling, is also studied. In addition, toggle-free coupling is defined as comprising all coupling faults that do not also include toggling faults. A lower bound of $2n\\sp2 + 3n$ is derived for general coupling. Marinescu's lower bound of $9n - 2$ for single coupling is generalized to hold for any test with or without an initialization sequence. GCTEST and SCTEST, of lengths $2n\\sp2 + 4n$ and $10n - 4$, are shown to detect general and single coupling, respectively, and conjectured to be optimal. TFCTEST, a test of length $15n - 14$ similar to a march test by Marinescu, is shown to detect 2-limited and toggle-free coupling. Abadir and Reghbati's improved version of GALPAT, of length $4n\\sp2 + 4n$, is shown to detect general toggling but not general coupling.

Au cours des années 50, quatre champs d'intérêt principaux émergent.

In the Sixties, when I was just beginning to play for people and write songs, the world began to recognize its oneness. We had a generation of people worldwide that began to appreciate the common strengths instead of fixating on what separated them. This spirit developed into a widespread embracing of each other's music and cultures -- at least important aspects of them. Some people are afraid of this but to me, it's a positive thing. My job is to try to trap the spirit of things, and the scratches of pen and paper, and the pulling of notes out of metal -- these become songs and the songs become fuel. They can become fuel for romance, for protest, for spiritual discovery, or for complacency.