Isbn International Standard Book Number

Take the guesswork out of using regular expressions. With more than 140 practical recipes, this cookbook provides everything you need to solve a wide range of real-world problems. Novices will learn basic skills and tools, and programmers and experienced users will find a wealth of detail. Each recipe provides samples you can use right away. This revised edition covers the regular expression flavors used by C#, Java, JavaScript, Perl, PHP, Python, Ruby, and VB.NET. You’ll learn powerful new tricks, avoid flavor-specific gotchas, and save valuable time with this huge library of practical solutions. Learn regular expressions basics through a detailed tutorial Use code listings to implement regular expressions with your language of choice Understand how regular expressions differ from language to language Handle common user input with recipes for validation and formatting Find and manipulate words, special characters, and lines of text Detect integers, floating-point numbers, and other numerical formats Parse source code and process log files Use regular expressions in URLs, paths, and IP addresses Manipulate HTML, XML, and data exchange formats Discover little-known regular expression tricks and techniques

Correlation Theory of Stationary and Related Random Functions is an elementary introduction to the most important part of the theory dealing only with the first and second moments of these functions. This theory is a significant part of modern probability theory and offers both intrinsic mathematical interest and many concrete and practical applications. Stationary random functions arise in connection with stationary time series which are so important in many areas of engineering and other applications. This book presents the theory in such a way that it can be understood by readers without specialized mathematical backgrounds, requiring only the knowledge of elementary calculus. The first volume in this two-volume exposition contains the main theory; the supplementary notes and references of the second volume consist of detailed discussions of more specialized questions, some more additional material (which assumes a more thorough mathematical background than the rest of the book) and numerous references to the extensive literature.

By the age of twenty-four, Air Force Staff Sergeant Mike Severance had already survived a series of missions in Afghanistan and Iraq. But his life back at home, in Texas, would prove a lot more dangerous... In the winter of 2005, Mike's wife, a veterinarian named Wendi Mae Davidson, reported him missing. Wendi told police that Mike had been acting erratically—visiting local clubs, staying out late, sometimes not coming home at all. She filed for divorce the very next day. Eventually Mike's body turned up in a stock pond on a private ranch. Investigators described a corpse that was weighted down with two cinder blocks, a rock, a boat anchor, and other equipment. It had also been stabbed forty-one times with a knife. But an autopsy report told a different story: That the cause of death was exposure to pentobarbital and phenobarbital, drugs commonly used in veterinary medicine. All the evidence pointed to Wendi...and soon she would be found guilty of murder in the first degree. Diane Fanning's A Poisioned Passion is the true, shocking story of a war hero and a marriage that ended in cold-blooded murder.

This book is an introduction to information and coding theory at the graduate or advanced undergraduate level. It assumes a basic knowledge of probability and modern algebra, but is otherwise self- contained. The intent is to describe as clearly as possible the fundamental issues involved in these subjects, rather than covering all aspects in an encyclopedic fashion. The first quarter of the book is devoted to information theory, including a proof of Shannon's famous Noisy Coding Theorem. The remainder of the book is devoted to coding theory and is independent of the information theory portion of the book. After a brief discussion of general families of codes, the author discusses linear codes (including the Hamming, Golary, the Reed-Muller codes), finite fields, and cyclic codes (including the BCH, Reed-Solomon, Justesen, Goppa, and Quadratic Residue codes). An appendix reviews relevant topics from modern algebra.