With the release of PHP 5 web developers need a guide to developing with PHP 5 to both learn its complex new features and more fully implement the long-standing features on which PHP’s success is built.Показать полностьюWith the release of PHP 5 web developers need a guide to developing with PHP 5 to both learn its complex new features and more fully implement the long-standing features on which PHP’s success is built. PHP 5 in Practice is a reference guide that provides developers with easy-to-use and easily extensible code to solve common PHP problems. It focuses on providing real code solutions to problems, allowing the reader to learn by seeing exactly what is happening behind the scenes to get your solution. Because a real-life situation will rarely match the book’s example problems precisely, PHP 5 in Practice explains the solution well enough that you will understand it and can learn how to truly solve your own problem.

Этот документ создан на основе компиляции нескольких документов, авторами которых являются перечисленные на титульной старнице люди, а также на основе перевода с английского страниц-учебников, которые в обилии можно встретить на многочисленных Web-узлах в Интернете, посвященных программированию на PHP и связи его с MySQL.Показать полностьюЭтот документ создан на основе компиляции нескольких документов, авторами которых являются перечисленные на титульной старнице люди, а также на основе перевода с английского страниц-учебников, которые в обилии можно встретить на многочисленных Web-узлах в Интернете, посвященных программированию на PHP и связи его с MySQL. Данный труд не ставит целью заменить собой мануалы по PHP и MySQL. Дело в том, что большинство материалов, в том числе и руководства к данным программным продуктам пока распространяются на английском языке. Качественные пособия на русском языке встречаются редко. Данный букварь просто поможет вам сделать первые шаги в изучении PHP и способах взаимодействия его с БД MySQL. Буду рад, если в этой книге вы найдете ответы на свои основные вопросы.

Учебное пособие по использованию языка РНР версии 4 содержит обширную информацию о приемах, призванных в кратчайшие сроки сделать новичка, владеющего хотя бы одним алгоритмическим языком, Web-программистом.Показать полностьюУчебное пособие по использованию языка РНР версии 4 содержит обширную информацию о приемах, призванных в кратчайшие сроки сделать новичка, владеющего хотя бы одним алгоритмическим языком, Web-программистом. Рассматриваются основы протоколов HTTP и CGI, схемы разработки крупных сценариев на РНР, синтаксис языка и работа с простейшими функциями, объектно-ориентированное программирование на РНР с применением идеологии интерфейсов, манипуляции со строками и массивами, создание баз данных и многое другое.

С помощью РНР 5 разрабатываются многочисленные компоненты, входящие в состав полнофункционального Web-сайта. Рассматриваются работа с СУБД MySQL, вопросы защиты Web-приложений, работа с графикой, Flash и PDF-документами.Показать полностьюС помощью РНР 5 разрабатываются многочисленные компоненты, входящие в состав полнофункционального Web-сайта. Рассматриваются работа с СУБД MySQL, вопросы защиты Web-приложений, работа с графикой, Flash и PDF-документами. В качестве практических примеров разработаны такие приложения, как система администрирования контента сайта, форум, система сбора и анализа статистики посетителей сайта, система рассылки, FTP-менеджер, универсальный каталог продукции и др. Книга ориентирована на читателей, знакомых с языками HTML и РНР, но не имеющих большого опыта разработки динамических Web-приложений. Компакт-диск содержит исходные коды всех Web-приложений, разрабатываемых в книге и в сумме составляющих готовый полнофункциональный корпоративный Web-сайт.

Просто и доступно изложены основы РНР — популярного языка написания скриптов для Web-страниц. Выполняя несложные примеры, читатель сможет освоить азы программирования на РНР, создать динамическую страницу, счетчик посещения сайта, систему голосования, адресную книгу, Интернет-магазин.Показать полностьюПросто и доступно изложены основы РНР — популярного языка написания скриптов для Web-страниц. Выполняя несложные примеры, читатель сможет освоить азы программирования на РНР, создать динамическую страницу, счетчик посещения сайта, систему голосования, адресную книгу, Интернет-магазин. Описаны типичные ошибки использования сценариев, а также пути их исправления. Книга содержит фрагменты кода, который можно применять при создании собственных проектов. Предназначена прежде всего для начинающих, но может быть полезна и опытным программистам, использующим РНР.

Этот учебник состоит в основном из справочника по функциям, но содержит также справочник по языку, разъяснения по некоторым основным возможностям языка PHP и другую сопутствующую информацию. Обязанность любого программиста — знать указанные в содержании книги азы.

Tunables (or configurable kernel parameters) are kernel variables that allow the operating system to be configured to fit specific system needs, resulting in better performance and/or more efficient allocation of resources.Показать полностьюTunables (or configurable kernel parameters) are kernel variables that allow the operating system to be configured to fit specific system needs, resulting in better performance and/or more efficient allocation of resources. The ideal value for each parameter is often determined by the system’s particular hardware configuration, the specific mix of applications the system runs, and the trustworthiness of system users: factors that vary widely from system to system. HP attempts to provide reasonable default parameter settings, but it may be necessary or beneficial to modify these settings to better suit the needs of your particular system’s users. Refer to the individual manpage to obtain detailed information about any configurable kernel parameter.

This book is written, chapter by chapter, by many of the most important researchers in this field- Since it is an advanced text, the content is a bit uneven and varied in writing style- It is essentially a compendium of review articles by experienced researches covering the various facets of the DL community.Показать полностьюThis book is written, chapter by chapter, by many of the most important researchers in this field- Since it is an advanced text, the content is a bit uneven and varied in writing style- It is essentially a compendium of review articles by experienced researches covering the various facets of the DL community. The choppy design is a small tradeoff for being able to get some very up-to-date information on Description Logics.

* Speech coding is a highly mature branch of signal processing deployed in products such as cellular phones, communication devices, and more recently, voice over internet protocol * This book collects many of the techniques used in speech coding and presents them in an accessible fashion * Emphasizes the foundation and evolution of standardized speech coders, covering standards from 1984 to the present * The theory behind the applications is thoroughly analyzed and proved.

This is a revised, expanded, and improved version of my textbook, Introduction to Queueing Theory. As before, it is written primarily for seniors and graduate students in operations research, computer science, and industrial engineering; and as before, the emphasis is on insight and understanding rather than either cookbook application or fine mathematical detail.Показать полностьюThis is a revised, expanded, and improved version of my textbook, Introduction to Queueing Theory. As before, it is written primarily for seniors and graduate students in operations research, computer science, and industrial engineering; and as before, the emphasis is on insight and understanding rather than either cookbook application or fine mathematical detail. Although it has been struc- structured for use primarily as a textbook, it should be a useful reference for researchers and practitioners as well. The second edition reflects the feedback of students and instructors who have used the first edition (which began as a set of notes for an in-house course I taught at Bell Laboratories), as well as my own experience teaching from the book at the Georgia Institute of Technology (in the School of Industrial and Systems Engineering and the School of Information and Computer Science), the University of Michigan (in the Department of Industrial and Operations Engineering), the New Mexico Institute of Mining and Technology (in the Department of Mathematics), and Florida Atlantic University (in the Department of Computer and Information Systems). The objective of the second edition is to improve on the first edition with respect to clarity, comprehensiveness, currency, and, especially, its utility both for teaching and, self-study.

The term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area.Показать полностьюThe term “stringology” is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as “algorithmic jewels” and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition algorithmic problems the discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms. In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.

This introduction to programming places computer science in the core of a liberal arts education. Unlike other introductory books, it focuses on the program design process.Показать полностьюThis introduction to programming places computer science in the core of a liberal arts education. Unlike other introductory books, it focuses on the program design process. This approach fosters a variety of skills — critical reading, analytical thinking, creative synthesis, and attention to detail — that are important for everyone, not just future computer programmers. The book exposes readers to two fundamentally new ideas. First, it presents program design guidelines that show the reader how to analyze a problem statement; how to formulate concise goals; how to make up examples; how to develop an outline of the solution, based on the analysis; how to finish the program; and how to test. Each step produces a well-defined intermediate product. Second, the book comes with a novel programming environment, the first one explicitly designed for beginners. The environment grows with the readers as they master the material in the book until it supports a full-fledged language for the whole spectrum of programming tasks. All the book’s support materials are available for free on the Web. The Web site includes the environment, teacher guides, exercises for all levels, solutions, and additional projects.

Parsing (syntactic analysis) is one of the best understood branches of computer science. Parsers are already being used extensively in a number of disciplines: in computer science (for compiler construction, database interfaces, self-describing data-bases, artificial intelligence), in linguistics (for text analysis, corpora analysis, machine translation, textual analysis of biblical texts), in document preparation and conversion, in typesetting chemical formulae and in chromosome recognition, to name a few; they can be used (and perhaps are) in a far larger number of disciplines.Показать полностьюParsing (syntactic analysis) is one of the best understood branches of computer science. Parsers are already being used extensively in a number of disciplines: in computer science (for compiler construction, database interfaces, self-describing data-bases, artificial intelligence), in linguistics (for text analysis, corpora analysis, machine translation, textual analysis of biblical texts), in document preparation and conversion, in typesetting chemical formulae and in chromosome recognition, to name a few; they can be used (and perhaps are) in a far larger number of disciplines. It is therefore surprising that there is no book which collects the knowledge about parsing and explains it to the non-specialist. Part of the reason may be that parsing has a name for being “difficult”. In discussing the Amsterdam Compiler Kit and in teaching compiler construction, it has, however, been our experience that seemingly difficult parsing techniques can be explained in simple terms, given the right approach. The present book is the result of these considerations.

2nd edition. Covers Boolean theory, number and character theory, bunch, set, string and list theory, functions and quantifiers, specifications, real time, robustness, data structures, control structures, subprograms, functional programming, recursive definition, data and program theories, concurrency, and communication. Contains 372 exercises at the end of the book, arranged by chapter.

The Encyclopedia of Information Science and Technology is the first work to map this ever-changing field. It is the most comprehensive, research-based encyclopedia consisting of contributions from over 900 noted researchers in over 50 countries.Показать полностьюThe Encyclopedia of Information Science and Technology is the first work to map this ever-changing field. It is the most comprehensive, research-based encyclopedia consisting of contributions from over 900 noted researchers in over 50 countries. This five-volume encyclopedia includes more than 550 articles highlighting current concepts, issues and emerging technologies. These articles are enhanced by special attention that is paid to over 4,500 technical and managerial terms. These terms will each have a 5-50 word description that allow the users of this extensive research source to learn the language and terminology of the field. In addition, these volumes offer a thorough reference section with over 11,500 sources of information that can be accessed by scholars, students, and researchers in the field of information science and technology.

Technical analysis, also known as “charting,” has been a part of financial practice for many decades, but this discipline has not received the same level of academic scrutiny and acceptance as more traditional approaches such as fundamental analysis.Показать полностьюTechnical analysis, also known as “charting,” has been a part of financial practice for many decades, but this discipline has not received the same level of academic scrutiny and acceptance as more traditional approaches such as fundamental analysis. One of the main obstacles is the highly subjective nature of technical analysis — the presence of geometric shapes in historical price charts is often in the eyes of the beholder. In this paper, we propose a systematic and automatic approach to technical pattern recognition using nonparametric kernel regression, and we apply this method to a large number of U.S. stocks from 1962 to 1996 to evaluate the effectiveness of technical analysis. By comparing the unconditional empirical distribution of daily stock returns to the conditional distribution-conditioned on specific technical indicators such as head-and-shoulders or double-bottoms — we find that over the 31-year sample period, several technical indicators do provide incremental information and may have some practical value.

Communication is a fundamental and integral part of computing, whether between different computers on a network, or between components within a single computer.Показать полностьюCommunication is a fundamental and integral part of computing, whether between different computers on a network, or between components within a single computer. In this book Robin Milner introduces a new way of modelling communication that reflects its position. He treats computers and their programs as themselves built from communicating parts, rather than adding communication as an extra level of activity. Everything is introduced by means of examples, such as mobile phones, job schedualers, vending machines, data structures, and the objects of object-oriented programming. But the aim of the book is to develop a theory, the pi-calculus, in which these things can be treated rigorously. The pi-calculus differs from other models of communicating behaviour mainly in its treatment of mobility. The movement of a piece of data inside a computer program is treated exactly the same as the transfer of a message--or indeed an entire computer program--across the internet. One can also describe networks which reconfigure themselves. The calculus is very simple but powerful; its most prominent ingredient is the notion of a name. Its theory has two important ingredients: the concept of behavioural (or observational) equivalence, and the use of a new theory of types to classify patterns of interactive behaviour. The internet, and its communication protocols, fall within the scope of the theory just as much as computer programs, data structures, algorithms and programming languages. This book is the first textbook on the subject; it has been long-awaited by professionals and will be welcome by them, and their students.

This book gives the concepts and background necessary to understand and build algorithms for computing elementary functions, presenting and structuring the algorithms (hardware- oriented as well as software-oriented), and discusses issues related to the accurate floating-point implementation.Показать полностьюThis book gives the concepts and background necessary to understand and build algorithms for computing elementary functions, presenting and structuring the algorithms (hardware- oriented as well as software-oriented), and discusses issues related to the accurate floating-point implementation. The purpose is not to give “cookbook recipes” that allow one to implement some given function, but to provide the reader with the knowledge that is necessary to build, or adapt, algorithms to their specific computing environment. Topics and Features: * background material reviewed in Chapter 2, Computer Arithmetic * polynomial and rational approximations * table based methods * shift-and-add algorithms thoroughly covered in Part Two * CORDIC algorithm * range reduction and accuracy covered in Part Three * Web site for the book containing additional resources and selected code The book provides an up-to-date presentation of the information needed to understand and accurately use mathematical functions and algorithms in computational work and design. Graduates, professionals and researchers in scientific computing, software engineering, and computer engineering will find the book a useful reference and resource.

Basic Category Theory for Computer Scientists provides a straightforward presentation of the basic constructions and terminology of category theory, including limits, functors, natural transformations, adjoints, and cartesian closed categories.

Secondo la mia esperienza, e sempre stato un compito difficile insegnare agli studenti l'uso della ricorsione. Quando viene presentata per la prima volta, essi reagiscono spesso con un certo sospetto all'idea, come se fosse stato presentato loro un trucco da prestigiatore e non una nuova metodologia di programmazione.Показать полностьюSecondo la mia esperienza, e sempre stato un compito difficile insegnare agli studenti l'uso della ricorsione. Quando viene presentata per la prima volta, essi reagiscono spesso con un certo sospetto all'idea, come se fosse stato presentato loro un trucco da prestigiatore e non una nuova metodologia di programmazione. Ne consegue che molti non imparano mai ad applicare le tecniche ricorsive; successivamente frequentano corsi piu avanzati senza saper scrivere programmi con una strategia ricorsiva. Con questo libro intendo demistificare questo argomento e incoraggiare gli studenti a «pensare ricorsivamente».