Все о внутреннем устройстве современного компьютера и периферийного оборудования, исчерпывающие источники информации о «железе» для энтузиастов и профессионалов – в этом разделе. Здесь представлена самая актуальная литература по ремонту, модернизации, работе с аппаратными прерываниями - от классической энциклопедии Модернизация и ремонт ПК, выдержавшей уже 19-е переиздание, до руководства Железо 2011, а также детальному описанию архитектуры микропроцессоров , BIOS, современных шинных протоколов.
Frederic P. Miller, Agnes F. Vandome, John McBrewster
High Quality Content by WIKIPEDIA articles! The Bourne shell, or sh, was the default Unix shell of Unix Version 7, and replaced the Thompson shell, whose executable file had the same name, sh. It was developed by Stephen Bourne, of AT Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.
ISBN: 978-6-1326-8117-1
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Bram Cohen (born 1975) is an American computer programmer, best known as the author of the peer-to-peer (P2P) BitTorrent protocol, as well as the first file sharing program to use the protocol, also known as BitTorrent. He is also the co-founder of CodeCon, organizer of the San Francisco Bay Area P2P-hackers meeting, and the co-author of Codeville. He currently lives in the San Francisco Bay Area with his wife Jenna and their three children Данное издание не...
ISBN: 978-6-1331-2803-3
Издательство:
Книга по требованию
Дата выхода: июль 2011
Frederic P. Miller, Agnes F. Vandome, John McBrewster
A branch (or jump on some computer architectures, such as the PDP-8 and Intel x86) is a point in a computer program where the flow of control is altered. The term branch is usually used when referring to a program written in machine code or assembly language; in a high-level programming language, branches usually take the form of conditional statements, subroutine calls or GOTO statements. An instruction that causes a branch, a branch instruction, can be taken or not taken: if a branch is not taken, the flow of control is unchanged and the next instruction to be executed is the instruction immediately following the current instruction in memory; if taken, the next instruction to be executed is an instruction at some other place in...
ISBN: 978-6-1307-5768-7
Издательство:
Книга по требованию
Дата выхода: июль 2011
Frederic P. Miller, Agnes F. Vandome, John McBrewster
In computer programming, a branch table (sometimes known as a jump table) is a term used to describe an efficient method of transferring program control (branching) to another part of a program (or a different program that may have been dynamically loaded) using a table of branch instructions. It is a form of multiway branch. The branch table construction is commonly used when programming in assembly language but may also be generated by a compiler, especially when implementing an optimized Switch statement (where known, small ranges are involved with few gaps). Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после...
ISBN: 978-6-1307-9437-8
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In Conway's Game of Life, a breeder is a pattern that exhibits quadratic growth, by generating multiple copies of a secondary pattern, each of which then generates multiple copies of a tertiary pattern. A gun than constructs more guns, while shifting the positions of its spaceship streams as to not have the guns collide. (The primary and secondary patterns are stationary, while the tertiary patterns move.) A spacefiller (which also undergoes quadratic growth) may be thought of as another class of breeder. However it differs from a true breeder in that it expands a single island of cells, rather than creating...
ISBN: 978-6-1332-2110-9
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Bremermann's Limit, named after Hans-Joachim Bremermann, is the maximum computational speed of a self-contained system in the material universe. It is derived from Einstein's mass-energy equivalency and the Heisenberg uncertainty principle, and is approximately 2.56 x 1047 bits per second per gram. This value is important when designing cryptographic algorithms, as it can be used to determine the minimum size of encryption keys or hash values required to create an algorithm that could never be cracked by a brute-force search. For example, a computer the size of the entire Earth, operating at the Bremermann's...
ISBN: 978-6-1332-2119-2
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Brian's Brain is a cellular automaton devised by Brian Silverman, which is very similar to his Seeds pattern. It consists of an infinite two-dimensional grid of cells, but unlike Seeds, each cell may be in one of three states: on, dying, or off. Each cell is considered to have eight neighbors (Moore neighborhood), as in Seeds and Conway's Game of Life. In each time step, a cell turns on if it was off but had exactly two neighbors that were on, just like the birth rule for Seeds. All cells that were on go into the dying state, which is not counted as an "on" cell in the neighbor count, and prevents any cell from...
ISBN: 978-6-1332-2128-4
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Broadcast Markup Language, or BML, is an XML-based standard developed by Japanese ARIB association as a data broadcasting specification for digital television broadcasting. It was finalized in 1999, becoming ARIB STD B24 "Data Coding and Transmission Specification for Digital Broadcasting". STD B24 specification is derived from an early draft of XHTML 1.0 strict, which it extends and alters. Some subset of CSS 1 and 2 is supported, as well as ECMAScript. Since version 1.0 in 1999, BML standard has gone through several revisions, and as of 2007[update], it is on version 5.0. However due to a large installed user...
ISBN: 978-6-1331-4710-2
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Brown University Interactive Language (BRUIN) was an introductory programming language developed at Brown University in the late 1960s. It operated in the IBM 360, and was similar to PL/1. The abstract of R. G. Munck's document, "Meeting the Computational Requirements of the University, Brown University Interactive Language" describes BRUIN as "a JOSS-like interpreter and a WATFOR-Like compiler and has a syntax very much like PL/I. It is intended that BRUIN and PL/I will together form a language system which will supply most of the (non-computer science) computational requirements of the university."...
ISBN: 978-6-1331-4726-3
Издательство:
Книга по требованию
Дата выхода: июль 2011
Frederic P. Miller, Agnes F. Vandome, John McBrewster
High Quality Content by WIKIPEDIA articles! In computer security and programming, a buffer overflow, or buffer overrun, is an anomaly where a process stores data in a buffer outside the memory the programmer set aside for it. The extra data overwrites adjacent memory, which may contain other data, including program variables and program flow control data. This may result in erratic program behavior, including memory access errors, incorrect results, program termination (a crash), or a breach of system security. Buffer overflows can be triggered by inputs that are designed to execute code, or alter the way the program operates. They are thus the basis of many software vulnerabilities and can be maliciously exploited. Bounds checking can...
ISBN: 978-6-1318-2808-9
Издательство:
Книга по требованию
Дата выхода: июль 2011
High Quality Content by WIKIPEDIA articles! Buffer overflow protection refers to various techniques used during software development to enhance the security of executable programs by detecting buffer overflows on stack-allocated variables as they occur and preventing them from becoming serious security vulnerabilities. There have been several implementations of buffer overflow protection. This article deals with stack-based overflow similar protections also exist against heap-based overflows, but they are implementation-specific. Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.
ISBN: 978-6-1316-6068-9
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In software testing, a Build Verification Test (BVT), also known as Build Acceptance Test, is a set of tests run on each new build of a product to verify that the build is testable before the build is released into the hands of the test team. The build acceptance test is generally a short set of tests, which exercises the mainstream functionality of the application software. Any build that fails the build verification test is rejected, and testing continues on the previous build (provided there has been at least one build that has passed the acceptance test). BVT is important because it lets developers know...
ISBN: 978-6-1332-2139-0
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Bunched logic is a variety of substructural logic that, like linear logic, has classes of multiplicative and additive operators, but differs from usual proof calculi in having a tree-like context of hypotheses instead of a flat list-like structure; it is thus a calculus of deep inference. Sub-trees of the context tree are referred to as bunches; hence the name.The semantics of bunched logic can be given in terms of Kripke models in which the set of worlds carries not only a preorder but also a monoidal product. Categorical models of bunched logic are given by doubly-closed categories, which are both cartesian...
ISBN: 978-6-1332-2178-9
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. BURS (bottom-up rewrite system) theory tackles the problem of taking a complex expression tree or intermediate language term and finding a good translation to machine code for a particular architecture. Implementations of BURS often employ dynamic programming to solve this problem. BURS can also be applied to the problem of designing an instruction set for an application-specific instruction-set processor Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.
ISBN: 978-6-1331-8465-7
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Burstsort and its variants are cache-efficient algorithms for sorting strings and are faster than quicksort and radix sort for large data sets. Burstsort algorithms use tries to store prefixes of strings, with growable arrays of pointers as end nodes containing sorted, unique, suffixes (referred to as buckets). Some variants copy the string tails into the buckets. As the buckets grow beyond a predetermined threshold, the buckets are "burst", giving the sort its name. A more recent variant uses a bucket index with smaller sub-buckets to reduce memory usage. Most implementations delegate to multikey quicksort, an...
ISBN: 978-6-1332-2179-6
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Bus contention, in computer design, is an undesirable state of the bus in which more than one device on the bus attempts to place values on the bus at the same time. Most bus architectures require their devices follow an arbitration protocol carefully designed to make the likelihood of contention negligible. However, when devices on the bus have logic errors, manufacturing defects or are driven beyond their design speeds, arbitration may break down and contention may result. Contention may also arise on systems which have a programmable memory mapping and when illegal values are written to the registers...
ISBN: 978-6-1332-2214-4
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer programming, BAL (an acronym for Business Application Language) refers to a high-level programming language similar to BASIC. It was originally defined by Honeywell in 1973 and the major diffusion was in their system '80-'90 in Europe with the work of French firm Prologue S.A. that used BAL for programming on their proprietary Operative System (Prologue). In 1986 the language was ported to the Unix platform by GuyPes. The first development environment, named Balix, are distributed starting in 1988 in Italy and France. A different evolution path was made by Prologue S.A., named ABAL, in 1992....
ISBN: 978-6-1331-4835-2
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. BYOA or Bring-Your-Own-Access is an approach to wireless remote access to a company's network for mobile workers and home workers. With BYOA, end users are still obliged to form their own contract with a wireless network operator. The remote user's software may recognise mobile hardware, such as a wireless data card, in their computer, and set up a data session over a VPN or other remote access client, but end users are still exposed to the fact that their connectivity is built up from separate components. Whilst this has been shown to be an effective means of providing connectivity, it detracts from global...
ISBN: 978-6-1346-3372-7
Издательство:
Книга по требованию
Дата выхода: июль 2011
Frederic P. Miller, Agnes F. Vandome, John McBrewster
The byte is a unit of digital information in computing and telecommunications. It is an ordered collection of bits, in which each bit denotes the binary value of 1 or 0. Historically, a byte was the number of bits used to encode a character of text in a computer and it is for this reason the basic addressable element in many computer architectures. The size of a byte is typically hardware dependent, but the modern de facto standard is 8 bits, as this is a convenient power of 2. Other factors behind this particular size may be the IBM System/360 architecture, introduced in the 1960s, and the 8-bit microprocessors, introduced in the 1970s. No formal definition exists however, and other sizes have been used in various computers...
ISBN: 978-6-1306-3529-9
Издательство:
Книга по требованию
Дата выхода: июль 2011
Frederic P. Miller, Agnes F. Vandome, John McBrewster
High Quality Content by WIKIPEDIA articles! The C programming language provides many standard library functions for file input and output. These functions make up the bulk of the C standard library header <stdio.h>. The I/O functionality of C is fairly low-level by modern standards; C abstracts all file operations into operations on streams of bytes, which may be "input streams" or "output streams". Unlike some earlier programming languages, C has no direct support for random-access data files; to read from a record in the middle of a file, the programmer must create a stream, seek to the middle of the file, and then read bytes in sequence from the stream. The stream model of file I/O was popularized by the Unix operating system,...
ISBN: 978-6-1327-8348-6
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The C Object Processor (COP) was a superset of the C programming language. It was used in the Vbase object-oriented database management system developed by Ontologic, Inc. The data model for Vbase was specified by a Type Definition Language (TDL). COP and TDL were influenced by CLU. By 1989, COP and TDL were replaced by C++ in Ontologic's second generation product, ONTOS. The company was also renamed ONTOS, Inc. Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения...
ISBN: 978-6-1331-4845-1
Издательство:
Книга по требованию
Дата выхода: июль 2011
Frederic P. Miller, Agnes F. Vandome, John McBrewster
High Quality Content by WIKIPEDIA articles! The C preprocessor cpp is the preprocessor for the C programming language. In many C implementations, it is a separate program invoked by the compiler as the first part of translation. The preprocessor handles directives for source file inclusion, macro definitions, and conditional inclusion. The language of preprocessor directives is agnostic to the grammar of C, so the C preprocessor can also be used independently to process other types of files. The transformations it makes on its input form the first four of C's so-called Phases of Translation. Though an implementation may choose to perform some or all phases simultaneously, it must behave as if it performed them one-by-one in order....
ISBN: 978-6-1317-2068-0
Издательство:
Книга по требованию
Дата выхода: июль 2011