krainaksiazek in search of a simple introduction to communication 20096949

- znaleziono 37 produktów w 6 sklepach

In Search Of A Simple Introduction To Communication - 2840257512

459,99 zł

In Search Of A Simple Introduction To Communication

Książki Obcojęzyczne>Angielskie>Humanities>Philosophy>Social & political philosophy


Introduction to Search with Sphinx - 2849849413

119,85 zł

Introduction to Search with Sphinx O´REILLY

Książki / Literatura obcojęzyczna

This concise introduction to Sphinx shows you how to use this free software to index an enormous number of documents and provide fast results to both simple and complex searches. Written by the creator of Sphinx, this authoritative book is short and to the point. * Understand the particular way Sphinx conducts searches * Install and configure Sphinx, and run a few basic tests * Issue basic queries to Sphinx at the application level * Learn the syntax of search text and the effects of various search options * Get strategies for dealing with large data sets, such as multi-index searching * Apply relevance and ranking guidelines for presenting best results to the user


A Simple Luhmann Economy - 2834693814

367,37 zł

A Simple Luhmann Economy VDM Verlag Dr. Müller

Książki / Literatura obcojęzyczna

The idea behind a simple Luhmann economy is a prototypical agent based model of a market as characterized by Niklas Luhmann in his publications about the economic function system of modern society.§§In line with sociological systems theory the cohesive or topological structure of communication (i.e. one communicative act - many understanding observers) is analysed.§§Niklas Luhmann's proposition, that the economy starts from and produces further inequality in order to continue could be reproduced by computer simulation.§§Together with the introduction of a formal notation for basic elements of Niklas Luhmann's theory this work tries to open a path for further exploration of sociological systems theory by computational methods The idea behind a simple Luhmann economy is a prototypical agent based model of a market as characterized by Niklas Luhmann in his publications about the economic function system of modern society. In line with sociological systems theory the cohesive or topological structure of communication (i.e. one communicative act - many understanding observers) is analysed. Niklas Luhmann's proposition, that the economy starts from and produces further inequality in order to continue could be reproduced by computer simulation. Together with the introduction of a formal notation for basic elements of Niklas Luhmann's theory this work tries to open a path for further exploration of sociological systems theory by computational methods


Statistical Methods For Communication Science - 2844441443

519,99 zł

Statistical Methods For Communication Science

Książki Obcojęzyczne>Angielskie>Reference, information & interdisciplinary sub.>Interdisciplinary studies>Communication studiesKsiążki Obc...

Statistical Methods For Communication Science Is A Textbook For Statistics In Communication Research. An Introduction To Statistical Methods, Key Topics Include The Fundamentals Of Measurement, Sampling Procedures, Probability, Reliability, Hypothesis Testing, Simple Correlation And Regression, And Analyses Of Variance And Covariance.


500 Simple Website Hints Tips and Techniques - 2212842792

70,80 zł

500 Simple Website Hints Tips and Techniques Rotovision


As the internet becomes ever more accessible, more and more people are setting up their own websites for personal or professional purposes. "500 Simple Website Hints, Tips, and Techniques" is a jargon-free handbook on the basics of website design. The book offers advice on planning your site, with an introduction to information architecture, tools, scripting basics, file and image formats, choosing and buying a domain name, and methods of testing websites. Key design aspects, such as colors, typefaces, and rollovers are also explored. To be successful, a website needs to be accessible to as many people as possible. The book includes essential advice on following web standards, ensuring a site loads quickly, achieving a high ranking on search engines, and offers tips on marketing strategies. Once you've got a website that works and can be easily found, the book explains the best way to add creative and fun extras, such as Flash animation, movies, audio, blogs, and podcasts.


Introduction to NLP - 2826769674

69,86 zł

Introduction to NLP THORSONS

Książki / Literatura obcojęzyczna

An Introduction to NLP reveals the techniques you need to achieve excellence in everything you do. Specially designed for audio with listener participation exercises, this CD focuses on communication strategies, using and understanding body languages, successful meetings and more! Some people appear more gifted than others. NLP (Neuro-Linguistic Programming), one of the fastest growing developments in applied psychology, describes in simple terms what these people do differently and enables you to learn these patterns of excellence. An Introduction to NLP teaches you practical skills to achieve excellent communication and great results in all areas of your life. Includes: * how to create rapport with others * influencing skills * understanding and using body language * how to think about and achieve the results you want * the art of asking key questions * effective meetings, negotiations and selling * accelerated learning strategies. Specifically designed for audio, this CD also includes exercises that encourage listener participation.


Signal Theoretic Introduction to Random Processes - 2826808928

600,72 zł

Signal Theoretic Introduction to Random Processes Wiley

Książki / Literatura obcojęzyczna

Presenting a rigorous introduction to the modelling and characterization of random phenomena, this book stands out from the existing texts in this field by characterizing random processes in signal theory. Instead of approaching randomness directly from random processes theory, the author places an emphasis on statistical signal theory, mathematical rigor, and using finite-time interval to establish results of random processes. One advantage to this theoretical approach is the unique framework provided to augment existing theory in the context of many unsolved problems. The use of a signal theory basis provides a general framework for defining functions used for characterizing random phenomena including the autocorrelation function and the power spectral density. The signal basis set approach for defining the power spectral density, which is the most widely used measure for characterizing random phenomena, provides a simple and natural interpretation of this function for the general case and for the usual case where a sinusoidal basis set is assumed. The usual approach to the power spectral density is through an autocorrelation function where an indirect interpretation can be provided for the restricted sinusoidal basis set case. Also, results for the important random phenomena encountered in the electronic and communications engineering field are given and include: the random walk, Brownian motion, the random telegraph signal, the Poisson point process, the Poisson counting process, shot noise, white noise, 1/f noise, signaling random processes, jittered random processes, random clustering, and birth-death random processes. Finally, the mathematical rigor underpins all aspects throughout the book, which demonstrates clarity and precision in the statement of results. The first five chapters provides the necessary background on the mathematical, signal theory, random variable theory, and random process theory to facilitate further development of random processes and random phenomena in the next chapters. Chapter 6 provides details the prototypical random processes that are fundamental to electrical, electronic, and communication engineering. Consequently, chapter 7-10 coverage includes details of the characterization of random phenomena from an engineering perspective: probability mass function/probability density function evolution, autocorrelation function, and power spectral density. Chapter 11 features an introduction to order statistics, which provides the background for a discussion of the Poisson point random process in Chapter 12. Chapter 13 introduces birth-death random processes and then Chapter 14 provides an introduction to first passage time theory.


Introduction to Computation and Programming Using Python - 2842365525

131,90 zł

Introduction to Computation and Programming Using Python University Press Group Ltd

Książki / Literatura obcojęzyczna

This book introduces students with little or no prior programming experience to the art of computational problem solving using Python and various Python libraries, including PyLab. It provides students with skills that will enable them to make productive use of computational techniques, including some of the tools and techniques of "data science" for using computation to model and interpret data. The book is based on an MIT course (which became the most popular course offered through MIT's OpenCourseWare) and was developed for use not only in a conventional classroom but in a massive open online course (or MOOC) offered by the pioneering MIT-Harvard collaboration edX. Students are introduced to Python and the basics of programming in the context of such computational concepts and techniques as exhaustive enumeration, bisection search, and efficient approximation algorithms. The book does not require knowledge of mathematics beyond high school algebra, but does assume that readers are comfortable with rigorous thinking and not intimidated by mathematical concepts. Although it covers such traditional topics as computational complexity and simple algorithms, the book focuses on a wide range of topics not found in most introductory texts, including information visualization, simulations to model randomness, computational techniques to understand data, and statistical techniques that inform (and misinform) as well as two related but relatively advanced topics: optimization problems and dynamic programming. Introduction to Computation and Programming Using Python can serve as a stepping-stone to more advanced computer science courses, or as a basic grounding in computational problem solving for students in other disciplines.


Introduction to Moroccan Arabic and Culture - 2836514004

202,41 zł

Introduction to Moroccan Arabic and Culture PLYMBRIDGE DISTRIBUTORS

Książki / Literatura obcojęzyczna

"An Introduction to Moroccan Arabic and Culture" and the accompanying multimedia DVD are designed to enable students to communicate effectively using Moroccan Arabic. Since Moroccan Arabic is rarely written or used in formal communication, the strength of the book lies in training learners in speaking and listening skills that can be used in everyday situations. Upon completing this course, students should be able to: greet people; introduce themselves; ask and reply to simple questions; use days and numbers in context; order food; shop; make appointments and reservations; give directions; talk about future plans; and, use common idiomatic expressions. Each chapter includes: cultural introductions to social, religious, or cultural aspects of Moroccan society; listening comprehension exercises; vocabulary exercises; dialogues and texts; conversation practice; grammar instruction on how native speakers structure their speech; and, interactive and video materials to support cultural understanding, listening, speaking, and grammar explanations. This book uses Romanized transcription alongside Arabic script for the first three chapters and thereafter only the Arabic script. It also includes a glossary and answer key. It requires approximately 120 contact hours, plus 180-240 additional hours of preparation outside class. A novice student should reach the intermediate-mid level of proficiency by the end of this course.


Distributed network protocols for anonymous stations in cooperative and noncooperative settings - 2619308978

28,00 zł

Distributed network protocols for anonymous stations in cooperative and noncooperative settings Politechnika Gdańska


This work studies the effects of station anonymity and/or noncooperative (selfish) station behavior upon the design and performance of selected distributed network protocols. A set of stations interconnected by a computer network are assumed to be engaged in a collective activity for which some inter-station consistency is required. The considered protocols relate to group communication (where message delivery in agreed order is required), random multiple access over a single channel (where collision avoidance is required), and packet forwarding (where maintenance of end-to-end paths is required). Design of distributed protocols for anonymous stations permits to dispense with costly authentication mechanisms, and provides a "security lower bound" for systems in which station identities are relied upon. Modeling of noncooperative settings (where stations are allowed to behave selfishly) is justified in view of the increased autonomy and user configurability of today's network components; at the same time, as a departure from the traditional engineering paradigm, it opens up interesting areas of networking research. In Chapter 2, two agreed order multicast protocols are proposed for anonymous stations in a cooperative setting. Both are LAN-oriented i.e., designed to yield high group throughput by exploiting the natural synchronism of single-broadcast transmission media. A faulty communication environment is assumed with occasional reception misses - failures by one or more stations to receive a message. The Distributed Precedence Graph (DPG) protocol is network-independent in that multicast and reception primitives clearly define a protocol-to-network interface, and missed message recovery is separated from message ordering. In contrast, the Jamming Protocol (JP) is network-dependent and exploits in a novel way the "ideal synchronism" of LAN broadcast to couple missed message recovery and message ordering. Both proposed protocols are insensitive to membership control mechanisms and do without the knowledge of station identities. Even so, they compare favorably with existing agreed order multicast protocols like LANSIS or TOTEM, as demonstrated by the analysis of logicaltime properties and simulation of stochastic performance. Chapters 3 through 5 are devoted to game-theoretic analysis of random access MAC-layer protocols in a noncooperative setting. Chapter 3 deals with CSMA/CA, the multiple access mechanism of the IEEE 802.11 MAC protocol. It is argued that in an ad hoc wireless LAN, CSMA/CA is vulnerable to a selfish backoff attack consisting in systematic selection of short backoff times. Network performance under a backoff attack is evaluated via extension of Bianchi's Markovian approximation, as well as using more accurate models. A sufficient condition of solvability is given and a game-theoretic analysis is carried out with stations' bandwidth shares regarded as payoffs. Launching a backoff attack is established as a strictly dominating action, the payoff structure of the resulting one-shot CSMA/CA game being similar to a multiplayer Prisoners' Dilemma (with a unique and Pareto non-optmal Nash equilibrium). The notion of a Nash capacity is introduced to show that selfish station behavior reduces the achievable bandwidth utilization roughly by half compared with a cooperative setting. Incentive-based discouragement of backoff attacks is proposed in Chapter 4 using the concept of a repeated CSMA/CA game, where a station is allowed to reconfigure its CSMA/CA mechanism based upon past payoffs. Assuming that most stations are interested in enforcing cooperative behavior of the other stations, a satisfactory equilibrium play is shown possible. In particular, a selfish station can be expected to incline to honest play for fear of the other stations inclining to selfish play. This idea is elaborated upon and gives rise to two proposed strategies of playing the repeated CSMA/CA game, called Cooperation via Randomized Inclination to Selfish Play (CRISP) and Selfish Play to Elicit Live-and-Let-live (SPELL). By exploiting another property of the one-shot CSMA/CA game, called coarse profile observability, CRISP and SPELL are shown to asymptotically achieve Pareto optimality and the related Nash equilibrium becomes subgame perfect. It is shown how to extend the proposed strategies if some stations disengage the CSMA/CA backoff scheme. Chapter 4 concludeswith a discussion of QoS-sensitive station behavior, in which case the CSMA/CA game may change from a Prisoners' Dilemma into a form of a queuing game. Selfish behavior of CSMA/CA stations studied in Chapters 3 and 4 only affects specific protocol parameters, leaving the very principle of contention unchanged. In Chapter 5 we look at a slightly more general model of single-channel contention. In the proposed framework, the MAC protocol proceeds in cycles, each of which accommodates the stations' requests to transmit. This subsumes various existing random token-like protocols e.g., CSMA/CA, Random Token, slotted ALOHA, and HIPERLAN/1. A selection configuration determines how the requests are placed, whereas a winner policy decides the winner of a contention. It is argued that while the winner policy must be agreed upon by all the stations, the selection configuration is entirely within a station's discretion. For a wide class of winner policies, called Random Token with Extraneous Collision Detection (RT/ECD), the notions of verifiability and viability are introduced to factor out brute-force selfish behavior, and shown to lead to two interesting winner policies, RT/ECD-0 and RT/ECD--. The resulting games are found to be a multiplayer Prisoners' Dilemma and an anti-coordination game, respectively. Related repeated games are again found to potentially lead to cooperative behavior. In Chapter 6, selfishness considerations are extended to the network layer of a mobile ad hoc network (MANET). Each MANET station generates source packets and also is supposed to forward transit packets for pairs of stations currently out of each other's reception range. It is argued that forwarding transit packets becomes a dual liability: it shortens the station's battery life "in exchange for" sacrificing a portion of the channel bandwidth that could be used for source packets. Under the introduced packet anonymity model (no packet reveals its source station except at destination), undetectable selfish manipulation of the local congestion controls is possible. The issue is addressed in a noncooperative game-theoretic framework: each MANET station selects its own strategy (congestion control settings) at will, so as to maximize some defined payoff (a combination of source packet throughput and a reputation measure). For a class of Drop-and-Throttle (D&T) congestion control mechanisms, a generic model is formulated, whereby a station adjusts its D&T threshold in response to the other stations' adjusted thresholds; this model is subsequently translated into a simple extensive-form game. Types of reachable Nash equilibria are discussed and the notion of robustness of a Nash equilibrium is introduced. Finally, a novel packet forwarding protocol called Fair Forwarding with Forced Transmissions (F3T) is presented, which, if properly configured, leads to a desirable type of Nash equilibrium. Spis treści: CONTENTS  LIST OF SYMBOLS AND ABBREVIATIONS 1. INTRODUCTION   1.1. Motivation, objective, and scope  1.2. Outline of the contents 2. MEMBERSHIP INSENSITIVE AGREED ORDER MULTICAST   2.1. Introduction and related work  2.2. Message ordering constraints  2.3. Jamming Protocol  2.3.1. LAN model  2.3.2. JP mechanisms and data structures  2.3.3. Jamming and lag detection Ethernet Token Ring  2.3.4. "Catch-up" mechanism  2.4. Evaluation of JP  2.4.1. Logical-time properties of JP  2.4.2. Stochastic performance of JP  2.5. Distributed Precedence Graph protocol  2.5.1. Network service model Wired or wireless single-channel LAN Tag seąuencer Bounded-deiay WAN with sparse group messages  2.5.2. DPG data structures and PDU types  2.5.3. Maintenance of strong ADO  2.5.4. Missed message recovery and flow control  2.6. Evaluation of DPG  2.6.1. Logical-time properties of DPG  2.6.2. Stochastic performance of DPG  2.7. Conclusion 3. BACKOFF ATTACK AND ONE-SHOT CSMA/CA GAME   3.1. Introduction and related work  3.2. Network operation  3.2.1. CSMA/CA contention under IEEE 802.11 DCF protocol  3.2.2. Network model  3.3. Solvability of EBM  3.3.1. Uniform CSMA/CA configuration profile  3.3.2. Non-uniform CSMA/CA configuration profile  3.4. Station performance  3.5. Backoff attack incentives  3.5.1. Selfish configurations  3.5.2. CSMA/CA game and Nash capacity  3.5.3. Selfish and greedy configurations Incentives in a binary set of actions Incentives in a temary set of actions  3.5.4. Mixed and Monte Carlo models  3.6. Conclusion 4. BACKOFF ATTACK DISCOURAGEMENT and REPEATED CSMA/CA GAME   4.1. Introduction and related work  4.2. Morę properties of one-shot CSMA/CA game  4.3. Repeated CSMA/CA game  4.3.1. Introduction to repeated games  4.3.2. Application to CSMA/CA game  4.4. CRISP strategy  4.4.1. Strategy description  4.4.2. Uncorrelated Pareto optimality and subgame perfection  4.4.3. Performance  4.4.4. Enforceability  4.4.5. Ternary CRISP  4.5. SPELL strategy  4.5.1. Strategy Description  4.5.2. Uncorrelated Pareto optimality and subgame perfection  4.5.3. Ternary SPELL  4.6. QoS game  4.6.1. One-shot QoS game  4.6.2. Dynamie QoS game scenarios  4.6.3. Stochastic QoS game  4.7. Conclusion and comments 5. NONCOOPERATIVE CHANNEL CONTENTION IN AD HOC LANS WITH ANONYMOUS STATIONS   5.1. Introduction  5.2. WLAN model  5.3. Framework for a winner policy  5.3.1. Reąuests to transmit  5.3.2. Verifiability  5.3.3. Performance objectives  5.3.4. Viability  5.4. Binary RT/ECD game  5.4.1. One-shot RT/ECD game  5.4.2. Stage-by-stage repeated RT/ECD game Nash strategy Idea Bag strategy  5.5. Cycle-by-cycle repeated RT/ECD game  5.5.1. Reinforcement learning strategies  5.5.2. Evolutionary stability  5.6. Conclusion 6. FAIR PACKET FORWARDING IN MOBILE AD HOC NETWORKS   6.1. Introduction  6.2. Related work  6.2.1. Reputation systems  6.2.2. Micropayment schemes  6.2.3. Game-theoretic approaches  6.3. Forwarding model and related selfish behavior  6.3.1. Forwarding model  6.3.2. Discussion of the model  6.3.3. Undetectable selfish behavior  6.4. Game-theoretic model  6.4.1. D&Tgame  6.4.2. Reachability of Nash eąuilibria  6.5. F3T protocol  6.5.1. Protocol description  6.5.2. D&T game payoffs under F3T  6.6. F3T protocol configuration and performance  6.7. Conclusion and future research 7. SUMMARY OF MAIN RESULTS BIBLIOGRAPHY  Summary in English  Summary in Polish


Differential Games - 2826648217

83,21 zł

Differential Games Dover Publications

Książki / Literatura obcojęzyczna

CHAPTER 1 An Introduction 1.1 The Theory of Games 1.2 The State of Control Variables 1.3 Battle Games 1.4 Games with Moving Craft 1.5 Pursuit Games 1.6 Games of Kind and Games of Degrees 1.7 Strategies 1.8 "Dogfights, Firing Games, Programming, and Athletics" 1.9 Two Examples 1.10 A Perspective on Precision 1.11 A Perspective on Progress 1.12 On Reading This Book "CHAPTER 2 Definitions, Formulation, and Assumptions" 2.1 The Kinematic Situation 2.2 The Realistic and Reduced Space 2.3 Termination of the Game 2.4 The Payoff 2.5 Games of Kind and Games of Degree 2.6 Strategies 2.7 Canonization of the Vectograms 2.8 A Lemma on Circular Vectograms CHAPTER 3 Discrete Differential Games 3.1 Introduction 3.2 The General Discrete Game 3.3 Battles of Extinction 3.4 Two Discrete Pursuit Games 3.5 Quasi-Discrete Games CHAPTER 4 The Basic Mathematics and the Solution Technique in the Small 4.1 The Nature of a Solution 4.2 The Main Equation 4.3 Semipermeable Surfaces and a Second Derivation of the Main Equation 4.4 The Verification Theorem 4.5 The Path Equations 4.6 The Retrogression Principle 4.7 The Initial Conditions CHAPTER 5 Mainly Examples: Transition Surfaces: Integral Constraints 5.1 Transition Surfaces 5.2 The Dolichobrachistochrone 5.3 The Relationship to the Euler Equation 5.4 The War of Attrition and Attack 5.5 The Isotropic Rocket Pursuit Game 5.6 An Optimal Program of Steel Production 5.7 Integral Constraints CHAPTER 6 Efferent of Dispersal Surfaces 6.1 Singular Surfaces 6.2 Dispersal Surfaces 6.3 The Nature of Dispersal Surfaces 6.4 The Question of the Perpetuated Dilemma 6.5 The Construction of Dispersal Surfaces 6.6 Further Examples 6.7 The Geometric Method for Simple Pursuit Games of Kind 6.8 Further Examples: The Football Players and the Cooperative Cutters 6.9 The Existence of the Perpetuated Dilemma 6.10 Various Problems CHAPTER 7 Afferent or Universal Surfaces 7.1 Introduction 7.2 Universal Surfaces with Null Integrand 7.3 "Universal Surfaces with Linear Vectograms, An Intuitive Purview" 7.4 The Analytic Necessary Condition for a Linear Vectogram Type Universal Service 7.5 The Workable Condition when n = 3 7.6 Why the Name Universal Surface? 7.7 The Calculus of Variations Viewpoint 7.8 All Strategies Optimal 7.9 The Workable Criterion when n = 4 7.10 A Test for a Void and a Further Necessary Condition for a Universal Service 7.11 Test for a Transition Surface 7.12 Further Discussion fo the Basic Nature of Universal Surfaces and Their Relation to the Euler Equation 7.13 Restoration of the Totality of Control Variables 7.14 Semiuniversal Surfaces CHAPTER 8 Games of Kind 8.1 Introduction 8.2 The Barrier Concept 8.3 The Construction of Semipermeable Surfaces 8.4 Termination of Barriers 8.5 Construction of the Barrier 8.6 Some Brief Examples 8.7 Possible Other Species of Barriers 8.8 Fusion of Games of Kind and Degree CHAPTER 9 Examples of Games of Kind 9.1 The Homicidal Chauffeur Game 9.1A Dogfighting a Highly Mobile Target 9.2 The Game of Two Cars 9.3 The Isotropic Rocket 9.4 The Isotropic Rocket: The Envelope Barrier 9.5 Two Remarkably Dissimilar Games in the Same Setting 9.6 Extensions and Applications of the Deadline Game 9.7 Further Games 9.8 Application to Stability and Control CHAPTER 10 Equivocal Surfaces and the Homicidal Chauffeur Game 10.1 Introduction 10.2 The Homicidal Chauffeur: Geometric Solution of the Game of Kind 10.3 The Primary Solution of the Homicidal Chauffeur Game of Degree 10.4 The Universal Curve and Its Tributaries 10.5 Equivocal Surfaces 10.6 An Example with an Equivocal Surface: Preliminaries 10.7 An Example with an Equivocal Surface: Solution 10.8 Discussion of Equivocal Surfaces 10.9 The Equivocal Phenomenon in the Homicidal Chauffeur Game 10.10 Appendix CHAPTER 11 The Application to Warfare 11.1 Game Theory and War 11.2 The Available Techniques 11.3 Types of Applications 11.4 The Broader Problems of Combat 11.5 Problems of Formulation 11.6 The War of Attrition and Attack: A Study 11.7 The Battle of Bunker Hill 11.8 Some Pitfalls in Adapting Game Theory to Warfare 11.9 War of Attrition and Attack: Second Version CHAPTER 12 Toward a Theory with Incomplete Information 12.1 Introduction 12.2 A Speculative Purview 12.3 Search Games with Immobile Hiders 12.4 Search Games with Mobile Hiders 12.5 The Importance of Approximations 12.6 The Chancifying Method APPENDIX A1. A Hit Probability Payoff A2. The Fixed Battery Pursuit Game A3. Optimal Trajectories of Guided Missiles A4. An Illustration from Control Theory A5. The Bomber and Battery Game REFERENCES INDEX


The Pencil Perfect - Caroline Weaver - 2853079717

97,05 zł

The Pencil Perfect - Caroline Weaver

Książki & Multimedia > Książki

Opis - The Pencil Perfect is the tangible tale of the pencil: a utensil that crafts its own story as humans use its sharpened point to write their own. The Pencil Perfect takes its namesake"s four simple ingredients " wood, graphite, clay, and water " and narrates a tale of worldwide influence and innovation. Caroline Weaver, pencil connoisseur and CW Pencil Enterprise Shop owner, composes texts that extol the nuanced influence of her beloved and humble implement. Illustrations exclusively drawn for The Pencil Perfect by Oriana Fenwick, an artist from Zimbabwe who works with fine details and intense realism, pair with Weaver"s words to present a story that is both endearing and enlightening. Through profiles of pencil makers, anecdotes about famous writers" favorite pencils, and essays about the surprising role of pencils in world history and culture, the chronicle of a modest but mighty tool unfolds. Follow the charming contrivance as it guides the course of early communication in the Scientific Revolution, the American Revolutionary War, the Anglo-French War, and the French Revolution: it is a historical journey and a captivating memoir. See how its past contemporarily compares with its use and appearance today " from the Blackwing 602 to novelty ferrules. The development of cultures and communities is laid bare within the timeline of this slender entity. The Pencil Perfect immortalizes the biography of an inanimate object within its pages for a future cast of historians, writers, and curious minds. Caroline Weaver is a life-long pencil obsessive who owns a shop dedicated solely to wood-cased pencils, new and old, from all over the world in New York City. As a child she coveted a set of Caran d?Ache Prismalo colored pencils and proudly sharpened six early-2000s-era black Ticonderogas before school each day. From there, her love of the pencil and knowledge of the subject flourished. After traveling the world in search of the finest pencils still in production, she opened her shop in 2015. Caroline lives in the East Village neighborhood of Manhattan and has a tattoo of a pencil on her forearm. Nazwa - The Pencil Perfect Autor - Caroline Weaver Oprawa - Twarda Wydawca - Gestalten Kod ISBN - 9783899556759 Kod EAN - 9783899556759 Rok wydania - 2017 Język - angielski Format - 17.5x24.6 Ilość stron - 144 Podatek VAT - 5%


Distributed Intelligent Sensor Network for Neurological Rehabilitation Research - 2853166218

208,76 zł

Distributed Intelligent Sensor Network for Neurological Rehabilitation Research Shaker Verlag

Książki / Literatura obcojęzyczna

This project introduces a distributed intelligent sensor network for neurological rehabilitation, designed to address clinical needs of patients with Parkinson's Disease (PD). Frequently, PD patients suffer from tremor at rest, rigidity, bradykinesia, and postural instability. Furthermore, there is often reduced coordination between respiration and locomotion, i.e., footsteps are in coordination with respiration in healthy subjects, whereas this coordination is disordered or even absent in PD patients. Monitoring and assessment of the coordination provides interesting insight into PD neurological rehabilitation: can the level of this coordination be an index for which the health status or rehabilitation progress of PD patients is gauged? Can improving this coordination promote rehabilitation of PD patients? Resolution of these issues requires a mobile sensor network system, which allows long-term monitoring of these vital signals, along with real-time analysis of the respiration-locomotion coordination during rehabilitation. This system may facilitate the assessment of therapeutic effects for PD, as well as the patients' health status. This system should satisfy the following requirements: ensure patient comfort through miniature form-factor; low-power operation to allow for an extended period of operation without battery exchange; continuous monitoring of vital signals and autonomous measurement; lossless continuous data acquisition and storage on sensor; real-time signal processing, including detection of step events and determination of respiratory phase; communication between devices, as well as data exchange with a PC for the system configuration, data visualization and further analysis. A number of ongoing projects have contributed to establishing proactive and unobtrusive body sensor network systems. For example, a range of wireless medical sensors has been developed based on the popular TinyOS hardware platforms. However, physical access to the commercial system can be extremely limited, thus hindering the adaptation of these systems for this project. Advances in wearable health systems have resulted in a variety of prototypes integrated with textile sensors. These systems integrate a data-logger to acquire raw data, which can then be sent to a remote expert center. Nevertheless, on-sensor processing is required to allow bio-feedback applications in the future. To meet the needs stated above, a distributed wireless communicating network of sensor nodes composed of intelligent Network Operating Devices (iNODE) has been developed. It focuses on the long-term monitoring and analysis of the respiration-locomotion coordination for PD patients. The sensor network system incorporates portable and patient-comfortable electronic sensors for sensing the vital signals with sensor nodes based on a microcontroller. The iNODEs include analog signal conditioning circuits connected with the sensors, thus allowing for lossless data acquisition, storage, and real-time signal processing on the sensors. A wireless solution based on IEEE 802.15.4 standard has been developed for data transmission within the sensor network and communication between the sensor network and the PC. The prototype of iNODEs can be folded into a 20x20x20mm cube. The compact size, along with flex-PCB and wireless design helps improve patient comfort. Ultra low-power electronics in the system allow for 24/7 recordings with lightweight Li-Ion batteries. The modular system conception enables different physical sensors to be easily plugged into the iNODEs, thus extending the possibility of further applications to be developed for this system. This dissertation describes the design of a system solution in cooperation with clinical partners, the search for suitable sensors according to the specifications, the process of integration of the sensors into the iNODE system, the development of the signal-conditioning circuits, the design of the real-time signal processing algorithms for feature extraction, and implementation of the algorithms on the iNODE-platform based on the microcontroller. In addition, preliminary tests of the system have been carried out in clinical setting successfully. The dissertation is divided into six chapters: 1) Introduction: clinical context (including pathology of PD), clinical applications of the sensor network, clinical and system design requirements and the conceptual design of the iNODE system. 2) Methods for step detection: review of frequently-used methods for step detection and its theoretical background. 3) Methods for respiratory monitoring: review of techniques for non-invasive assessment of respiration with sections on calculation of respiratory phase and coordination between steps and respiratory phase. 4) The iNODE system: hardware platform, wireless communication, software structures and fixed-point algorithms for real-time signal processing. 5) Results: evaluation of signal-processing algorithms using clinical data and results of real-time implementation of the algorithms. 6) Summary and perspectives: conclusions and recommendations for future research. The dissertation encompasses a wide scope of technical disciplines: sensor technology, electronic circuit design, signal processing algorithms, embedded system (including both software and hardware), as well as wireless communication. It explains step detection and phase determination from theoretical and practical standpoints. Major components and processes of the development of the sensor network system for the clinical application are described in detail in the dissertation. In the next stage, this system will be tested in a clinical setting of occupational therapy involving PD patients on a treadmill. After the evaluation of this stage, further studies using this mobile wireless system will be conducted for long-term recording during daily life.


Plecak ergonomiczny sztywny FC Barcelona - 2845450883

205,46 zł

Plecak ergonomiczny sztywny FC Barcelona

Książki & Multimedia > Książki

Opis - Ergonomiczny plecak trzykomorowy, licencja FC Barcelona. Usztywnione gąbką plecy, szerokie, regulowane, miękkie szelki, 2 małe boczne kieszonki. Nazwa - Plecak ergonomiczny sztywny FC Barcelona Kod EAN - 3831115165325 Wydawca - MST TOYS Podatek VAT - 23%


Mathematics and the Imagination - 2842080323

83,21 zł

Mathematics and the Imagination Dover Publications

Książki / Literatura obcojęzyczna

Introduction I. NEW NAMES FOR OLD Easy words for hard ideas Transcendental Non-simple curve Simple curve Simple group Bolsheviks and giraffes Turbines Turns and slides Circles and cycles Patho-circles Clocks Hexagons and parhexagons "Radicals, hyperradicals, and ultraradicals (nonpolitical)" New numbers for the nursery Googol and googolplex Miracle of the rising book The mathescope II. BEYOND THE GOOGOL Counting?the language of number "Counting, matching, and "Going to Jerusalem" Cardinal numbers Cosmic chess and googols The sand reckoner Mathematical induction The infinite and its progeny Zeno Puzzles and quarrels Bolzano Galileo's puzzle Cantor Measuring the measuring rod The whole is no greater than some of its parts The first transfinite?Alepho Arithmetic for morons Common sense hits a snag Cardinality madman The tortoise unmasked Motionless motion Private life of a number The house that Cantor built III. "Pie, i, e (PIE)" Chinamen and chandeliers Twilight of common sense "Pie, i, e" Squaring the circle and its cousins Mathematical impossibility "Silk purse, sow's ear, ruler and compass" Rigor mortis Algebraic equations and transcendental numbers Galois and Greek epidemics Cube duplicators and angle trisectors Biography of pie "Infancy: Archimedes, the Bible, the Egyptians" "Adolescence: Vieta, Van Ceulen" "Maturity: Wallis, Newton, Leibniz" "Old Age: Dase, Richter, Shanks" Victim of schizophrenia Boon to insurance companies (e) Logarithms or tricks of the trade Mr. Briggs is surprised Mr. Napier explains "Biography of e; or e, the banker's boon" Pituitary gland of mathematics: the exponential function (i) "Humpty Dumpty, Doctor or Semantics" Imaginary numbers "The v-1, or "Where am I?" " "Biography of i, the self-made amphibian" "Omar Khayyám, Cardan, Bombelli, and Gauss" i and Soviet Russia Program music of mathematics "Breakfast in bed; or, How to become a great mathematician" Analytic geometry Geometric representation of i Complex plane "A famous formula, faith, and humility" IV. ASSORTED GEOMETRIES?PLANE AND FANCY The talking fish and St. Augustine A new alphabet High priests and mumbo jumbo Pure and applied mathematics Euclid and Texas Mathematical tailors Geometry?a game "Ghosts, table-tipping, and the land of the dead" Fourth-dimension flounders Henry More to the rescue Fourth-dimension?a new gusher A cure for arthritis Syntax suffers a setback The physicist's delight Dimensions and manifolds Distance formulae Scaling blank walls Four-dimensional geometry defined Moles and tesseracts A four-dimensional fancy Romance of flatland Three-dimensional cats and two-dimensional kings Gallant Gulliver and the gloves Beguiling voices and strange footprints Non-Euclidean geometry Space credos and millinery Private and public space Rewriting our textbooks The prince and the Boethians The flexible fifth The mathematicians unite?nothing to lose but their chains Lobachevsky breaks a link Riemann breaks another Checks and double checks in mathematics The tractrix and the pseudosphere Great circles and bears The skeptic persists?and is stepped on Geodesics Seventh Day Adventists Curvature Lobachevskian Eiffel Towers and Riemannian Holland Tunnels V. PASTIMES OF PAST AND PRESENT TIMES Puzzle acorns and mathematical oaks Charlemagne and crossword puzzles "Mark Twain and the "farmer's daughter" The syntax of puzzles Carolyn Flaubert and the cabin boy "A wolf, a goat, and a head of cabbage" Brides and cuckolds I'll be switched "Poisson, the misfit" "High finance; or, The international beer wolf" Lions and poker players The decimal system Casting out nines "Buddha, God, and the binary scale" "The march of culture; or, Russia, the home of the binary system" The Chinese rings The tower of Hanoi "The ritual of Benares: or, Charley horse in the Orient" "Nim, Sissa Ben Dahir, and Josephus" Bismarck plays the boss The 15 puzzle plague The spider and the fly A nightmare of relatives The magic square Take a number from 1 to 10 Fermat's last theorem Mathematics' lost legacy VI. PARADOX LOST AND PARADOX REGAINED Great paradoxes and distant relatives Three species of paradox Paradoxes strange but true Wheels that move faster on top than on bottom The cycloid family "The curse of transportation; or, How locomotives can't make up their minds" Reformation of geometry Ensuing troubles Point sets?the Arabian Nights of mathematics Hausdorff spins a tall tale Messrs. Banach and Tarski rub the magic lamp Baron Munchhausen is stymied by a pea Mathematical fallacies "Trouble from a bubble; or, Dividing by zero" The infinite?troublemaker par excellence Geometrical fallacies Logical paradoxes?the folk tales of mathematics Deluding dialectics of the poacher and the prince; of the introspective barber; of the number 111777; of this book and Confucius; of the Hon. Bertrand Russell "Scylla and Charybdis; or, What shall poor mathematics d "Twits Napoleon, who does" The Marquis de Condorcet has high hopes M. le Marquis omits a factor and loses his head Fourier of the Old Guard Dr. Darwin of the New The syllogism scraps a standby Mr. Socrates may not die "Ring out the old logic, ring in the new" VIII. RUBBER-SHEET GEOMETRY Seven bridges over a stein of beer Euler shivers Is warmed by news from home Invents topology Dissolves the dilemma of Sunday strollers Babies' cribs and Pythagoreans Talismen and queer figures Position is everything in topology Da Vinci and Dali Invariants Transformations The immutable derby "Competition for the caliph's cup; or, Sifting out the suitors by science" Mr. Jordan's theorem Only seems idiotic Deformed circles Old facts concerning Times Square and a balloonist's head Eccentric deportment of several distinguished gentlemen at Princeton Their passion for pretzels Their delving in doughnuts Enforced modesty of readers and authors The ring Lachrymose recital around a Paris pissoir "Who staggered how many times around the walls of what?" In and out the doughnut Gastric surgery?from doughnut to sausage in a single cut N-dimensional pretzels The Möbius strip Just as black as it is painted Foments industrial discontent Never takes sides Bane of painter and paintpot alike The iron rings "Mathematical cotillion; or, How on earth do I get rid of my partner?" "Topology?the pinnacle of perversity; or, Removing your vest without your coat" Down to earth?map coloring Four-color problem Euler's theorem The simplest universal law Brouwer's puzzle The search for invariants IX. CHANGE AND CHANGEABILITY The calculus and cement Meaning of change and rate of change Zeno and the movies "Flying Arrow" local?stops at all points" Geometry and genetics The arithmetic men dig pits Lamentable analogue of the boomerang History of the calculus Kepler Fermat Story of the great rectangle Newton and Leibniz Archimedes and the limit "Shrinking and swelling; or, "Will the circle go the limit?" Brief dictionary of mathematics and physics "Military idyll; or, The speed of the falling bomb" The calculus at work The derivative Higher derivatives and radius of curvature Laudable scholarship of automobile engineers The third derivative as a shock absorber The derivative finds its mate Integration Kepler and the bungholes "Measuring lengths; or, The yawning regress" Methods of approximation Measuring areas under curves Method of rectangular strips The definite Indefinite On the inverse of the other "The outline of history and the descent of man: or, y=ex" Sickly curves and orchidaceous ones The snowflake Infinite perimeters and postage stamps Anti-snowflake Super-colossal pathological specimen?the curve that fills space The unbelievable crisscross EPILOGUE. MATHEMATICS AND THE IMAGINATION


szukaj w Kangoo krainaksiazek in search of a simple introduction to communication 20096949

Sklepy zlokalizowane w miastach: Warszawa, Kraków, Łódź, Wrocław, Poznań, Gdańsk, Szczecin, Bydgoszcz, Lublin, Katowice

Szukaj w sklepach lub całym serwisie

1. Sklepy z krainaksiazek pl in search of a simple introduction to communication 20096949

2. Szukaj na wszystkich stronach serwisu

t1=0.102, t2=0, t3=0, t4=0.014, t=0.102

Dla sprzedawców

copyright © 2005-2017  |  made by Internet Software House DOTCOM RIVER