 |
|
|
 Fundamentals of Logic Design (with Companion CD-ROM)
After studying this text, you should be able to apply switching theory to the solution of
logic design problems.This means that you will learn both the basic theory of switching
circuits and how to apply it. After a brief introduction, you will study Boolean algebra,
which is the basic mathematical tool needed to analyze and synthesize... |  |  Wirelessness: Radical Empiricism in Network Cultures
Motion, to take a good example, is originally a turbid sensation, of which the native
shape is perhaps best preserved in the phenomenon of vertigo. (James 1996a, 62)
Between 1999 and 2009, a “ turbid ” or disordered sensation of change was
felt as wireless connections expanded and eroded the edges of the Internet... |  |  The AWK Programming Language
Computer users spend a lot of time doing simple, mechanical data manipulation
- changing the format of data, checking its validity, finding items with
some property, adding up numbers, printing reports, and the like. All of these
jobs ought to be mechanized, but it's a real nuisance to have to write a specialpurpose
program in a... |
|
 Introduction to MATLAB for Engineers
Formerly used mainly by specialists in signal processing and numerical
analysis, MATLAB® in recent years has achieved widespread and enthusiastic
acceptance throughout the engineering community. Many engineering
schools now require a course based entirely or in part on MATLAB early in
the curriculum. MATLAB is programmable and has... |  |  Professional Plone 4 Development
I suspect Martin plied me to write this foreword while out one evening during the 2010 Plone Conference in Bristol. Full from an excellent dinner and even better conversation, beer in hand, who could say no?
I've long envied Martin's ability to write. Text and code flow from his fingers at a rate that I can't even begin... |  |  The Design of Dynamic Data Structures (Lecture Notes in Computer Science) (v. 156)
In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects... |
|
|
Result Page: 414 413 412 411 410 409 408 407 406 405 404 403 402 401 400 399 398 397 396 |