Все о внутреннем устройстве современного компьютера и периферийного оборудования, исчерпывающие источники информации о «железе» для энтузиастов и профессионалов – в этом разделе. Здесь представлена самая актуальная литература по ремонту, модернизации, работе с аппаратными прерываниями - от классической энциклопедии Модернизация и ремонт ПК, выдержавшей уже 19-е переиздание, до руководства Железо 2011, а также детальному описанию архитектуры микропроцессоров , BIOS, современных шинных протоколов.
Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
High Quality Content by WIKIPEDIA articles! Transformation of text refers to strategies to transform text, particularly in systems that do not support transformation, such as HTML, seven-segment displays and plain text. Many systems, such as HTML, seven-segment displays and plain text, do not support transformation of text. In the case of HTML, this limitation in display may eventually be addressed through standard cascading style sheets (CSS), since proposed specifications for CSS3 include rotation for block elements. In the meantime, several ways of producing the visual effects of text transformations have come into use. Данное издание не является оригинальным. Книга печатается по...
ISBN: 978-6-1305-1416-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. Transaction Application Language or TAL (originally "Tandem Application Language") is a block-structured, procedural language optimized for use on Tandem hardware. TAL resembles a cross between C and Pascal. It was the original system programming language for the Tandem CISC machines, which had no assembler. The design concept of TAL, an evolution of Hewlett Packard's SPL, was intimately associated and optimized with a microprogrammed CISC instruction set. Each TAL statement could easily compile into a sequence of instructions that manipulated data on a transient floating register stack. The register stack...
ISBN: 978-6-1332-0925-1
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
High Quality Content by WIKIPEDIA articles! A tree rotation is an operation on a binary tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. They are used to change the shape of the tree, and in particular to decrease its height by moving smaller subtrees down and larger subtrees up, resulting in improved performance of many tree operations.This article takes the approach of the side where the nodes get shifted is the direction of the rotation. Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения...
ISBN: 978-6-1311-5532-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. Treelang is a "toy" programming language distributed with the GNU Compiler Collection (GCC) to demonstrate the features of its code-generation backend. It was developed by Tim Josling, based on a language called Toy created by Richard Kenner. During the GCC 4.3 release cycle, a patch was committed to remove the language, because of high maintenance costs outweighing its benefits and also because it was no longer considered a good front-end example by GCC developers. Данное издание не является оригинальным. Книга печатается по технологии...
ISBN: 978-6-1332-0933-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. Trivial Graph Format (TGF) is a very simple text-based file format for describing graphs. It consists of a list of node definitions, which map node IDs to labels, followed by a list of edges, which specify node pairs and an optional edge label. Node IDs can be arbitrary identifiers, whereas labels for both nodes and edges are plain strings. The graph may be interpreted as a directed or undirected graph. For directed graphs, to specify the concept of bidirectionality in an edge, one may either specify two edges (forward and back), or differentiate the edge by means of a label. For more powerful specification of...
ISBN: 978-6-1332-0947-3
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
High Quality Content by WIKIPEDIA articles! In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic unsolvability of the set. The concept of Turing degree is fundamental in computability theory, where sets of natural numbers are often regarded as decision problems; the Turing degree of a set tells how difficult it is to solve the decision problem associated with the set. Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.
ISBN: 978-6-1303-5360-5
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
High Quality Content by WIKIPEDIA articles! A computational system that can compute every Turing-computable function is called Turing-complete (or Turing-powerful). Alternatively, such a system is one that can simulate a universal Turing machine.A Turing-complete system is called Turing-equivalent if every function it can compute is also Turing-computable; i.e., it computes precisely the same class of functions as do Turing machines. Alternatively, a Turing-equivalent system is one that can simulate, and be simulated by, a universal Turing machine. (All known Turing-complete systems are Turing-equivalent, which adds support to the Church-Turing thesis.) Данное издание не является оригинальным....
ISBN: 978-6-1303-5349-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. Tweak is a graphical user interface (GUI) layer to the Squeak development environment, which in turn is an integrated development environment based on the Smalltalk-80 computer programming language. Tweak is an alternative to an earlier graphic user interface layer called Morphic. Development began in 2001. Applications that use the Tweak software include Sophie (version 1), a multimedia and e-book authoring system, and a family of virtual world systems: Open Cobalt, Teleplace and the Croquet Project. An experimental version of Etoys used Tweak instead of Morphic. Данное издание не...
ISBN: 978-6-1332-0978-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. A two-level grammar is a formal grammar that is used to generate another formal grammar, such as one with an infinite rule set. This is how a Van Wijngaarden grammar was used to specify Algol68 . A context free grammar that defines the rules for a second grammar can yield an effectively infinite set of rules for the derived grammar. This makes such two-level grammars more powerful than a single layer of context free grammar, because generative two-level grammars have actually been shown to be Turing complete.Two-level grammar can also refer to a formal grammar for a two-level formal language, which is a formal...
ISBN: 978-6-1332-0977-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. In programming languages, type erasure refers to the compile-time process by which explicit type annotations are removed from a program, before it is executed at run-time. An operational semantics that does not require programs to be accompanied by types is called a type-erasure semantics, to be contrasted with a type-passing semantics. The possibility of giving a type-erasure semantics is a kind of abstraction principle, ensuring that the run-time execution of a program does not depend on type information. Данное издание не является оригинальным. Книга...
ISBN: 978-6-1332-1009-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. In computer science, type safety is the extent to which a programming language discourages or prevents type errors. A type error is erroneous or undesirable program behaviour caused by a discrepancy between differing data types. Type safety is sometimes alternatively considered to be a property of a computer program rather than the language in which that program is written; that is, some languages have type-safe facilities that can be circumvented by programmers who adopt practices that exhibit poor type safety. The formal type-theoretic definition of type safety is considerably stronger than what is understood...
ISBN: 978-6-1332-1010-3
Издательство:
Книга по требованию
Дата выхода: июль 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 science, a type signature defines the inputs and outputs for a function, subroutine or method. A type signature includes at least the function name and the number of its arguments. In some programming languages, it may also specify the function's return type, the types of its arguments, or errors it may pass back.Notice that the type of the result can be regarded as everything past the first supplied argument. This is a consequence of currying, which is made possible by Haskell's support for first-class functions. That is, given a function that takes in two inputs, but had one argument supplied, the...
ISBN: 978-6-1332-1017-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. In computer science, a typed assembly language (TAL) is an assembly language that is extended to include a method of annotating the datatype of each value that is manipulated by the code. These annotations can then be used by a program (type checker) that processes the assembly language code in order to analyse how it will behave when it is executed. Specifically, such a type checker can be used to prove the type safety of code that meets the criteria of some appropriate type system. Typed assembly languages usually include a high-level memory management system based on a garbage collection. A typed assembly...
ISBN: 978-6-1332-1026-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 languages, TypeParameter is a frequently-used generic label used in templates to reference an unknown data type, data structure, or class. Templates are most frequently used in Java and C++. TypeParameter is similar to a metasyntactic variable (e.g., "foo" and "bar"), but distinct. It is not the name of a generic variable, but the name of a generic type of variable. The capitalization varies according to programming language and programmer preference. TypeParameter, Typeparameter, TYPEPARAMETER, typeparameter, and type_parameter are all possible. Alternate labels are also used, especially...
ISBN: 978-6-1332-1033-2
Издательство:
Книга по требованию
Дата выхода: июль 2011
The overarching goal of the current book is to pave the road towards a comprehensive solution to the decades old problem of integrating databases and programming languages. For this purpose, we propose a record calculus as an extension of an ML-style functional programming language core that is powerful enough to allow type inference for user-defined polymorphic relational operators. The type system described in the book allows the definition and typing of standard relational operators like join, project, divide, restrict, and others in a flexible, polymorphic way. Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после...
ISBN: 978-3-6390-6854-2
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
High Quality Content by WIKIPEDIA articles! UBB.threads (formerly WWWThreads) is an Internet forum software package written by Rick Baker. Written with PHP using a MySQL database backend, it is comparable to other forum software written in PHP. WWWThreads was originally written in Perl starting in 1997, then a PHP version was made in 2000. WWWThreads was notable for being one of the first forum software packages to support both flat and threaded discussion. In 2001, WWWThreads was acquired by Infopop Corporation (later known as Groupee, Inc. and now known as Social Strata), owners of the Ultimate Bulletin Board software. It was consequently renamed UBB.threads. Данное издание не является оригинальным....
ISBN: 978-6-1312-2600-7
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
High Quality Content by WIKIPEDIA articles! Ubercode is a high level platform-sharing programming language designed by Ubercode Software and released in 2005 for Microsoft Windows. Ubercode is influenced by the Eiffel and BASIC. A programming language is an artificial language designed to express computations that can be performed by a machine, particularly a computer. Programming languages can be used to create programs that control the behavior of a machine, to express algorithms precisely, or as a mode of human communication. Many programming languages have some form of written specification of their syntax (form) and semantics (meaning). Some languages are defined by a specification document. For example, the C programming language...
ISBN: 978-6-1305-5537-5
Издательство:
Книга по требованию
Дата выхода: июль 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. UWE (UML-based Web Engineering) is a software engineering approach for the development of Web applications. UWE provides a UML profile (UML extension), a metamodel, model-driven development process and tool support for the systematic design of Web applications (MagicUWE). UWE follows the separation of concerns building separate models for requirements, content, navigation, presentation, process, adaptation and architecture. The key aspects that distinguish UWE are reliance on OMG standards. Данное издание не является оригинальным. Книга печатается по...
ISBN: 978-6-1332-1040-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. Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The relationship between Unicode and HTML tends to be a difficult topic for many computer professionals, document authors, and web users alike. The accurate representation of text in web pages from different natural languages and writing systems is complicated by the details of character encoding, markup language syntax, font, and varying levels of support by web browsers.Web pages are typically HTML or XHTML documents. Both types of documents consist, at a fundamental level, of...
ISBN: 978-6-1346-5525-5
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
High Quality Content by WIKIPEDIA articles! UniDirectional Link Detection (UDLD) is a data link layer protocol from Cisco Systems to monitor the physical configuration of the cables and detect unidirectional links. UDLD complements the Spanning Tree Protocol (STP) which is used to eliminate layer 2 loops. If two devices, A and B, are connected via a pair of fibres, one used for sending from A to B, other from sending from B to A, it is a bidirectional link (two-way link). If one of these fibres are broken, we're left with a unidirectional link (one-way link). The goal of the UDLD protocol is to detect whenever a bidirectional link is either broken, such that packets are sent only from one device to another, or connected wrongly, such...
ISBN: 978-6-1324-8054-5
Издательство:
Книга по требованию
Дата выхода: июль 2011
Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
High Quality Content by WIKIPEDIA articles! Unified Parallel C (UPC) is an extension of the C programming language designed for high-performance computing on large-scale parallel machines, including those with a common global address space (SMP and NUMA) and those with distributed memory (eg. clusters). The programmer is presented with a single shared, partitioned address space, where variables may be directly read and written by any processor, but each variable is physically associated with a single processor. UPC uses a Single Program Multiple Data (SPMD) model of computation in which the amount of parallelism is fixed at program startup time, typically with a single thread of execution per processor. Данное издание не...
ISBN: 978-6-1305-2808-9
Издательство:
Книга по требованию
Дата выхода: июль 2011