THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

The Design and Analysis of Experiments

Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

As we are moving towards the Internet of Things (IoT), the number of sensors deployed around the world is growing at a rapid pace. Market research has shown a significant growth of sensor deployments over the past decade and has predicted a significant increment of the growth rate in the future. These sensors continuously generate enormous amounts of data. However, in order to add value to raw sensor data we need to understand it. Collection, modelling, reasoning, and distribution of context in relation to sensor data plays critical role in this challenge. Context-aware computing has proven to be successful in understanding sensor data. In this paper, we survey context awareness from an IoT perspective. We present the necessary background by introducing the IoT paradigm and context-aware fundamentals at the beginning. Then we provide an in-depth analysis of context life cycle. We evaluate a subset of projects (50) which represent the majority of research and commercial solutions proposed in the field of context-aware computing conducted over the last decade (2001-2011) based on our own taxonomy. Finally, based on our evaluation, we highlight the lessons to be learnt from the past and some possible directions for future research. The survey addresses a broad range of techniques, methods, models, functionalities, systems, applications, and middleware solutions related to context awareness and IoT. Our goal is not only to analyse, compare and consolidate past research work but also to appreciate their findings and discuss their applicability towards the IoT.

/pdf/context-aware-computing-for-the-internet-of-things-a-survey-3nibvvc921.pdf

Context Aware Computing for The Internet of Things: A Survey

Introduction to linear and nonlinear programming

Unmanned aerial vehicles (UAVs) have enormous potential in the public and civil domains. These are particularly useful in applications, where human lives would otherwise be endangered. Multi-UAV systems can collaboratively complete missions more efficiently and economically as compared to single UAV systems. However, there are many issues to be resolved before effective use of UAVs can be made to provide stable and reliable context-specific networks. Much of the work carried out in the areas of mobile ad hoc networks (MANETs), and vehicular ad hoc networks (VANETs) does not address the unique characteristics of the UAV networks. UAV networks may vary from slow dynamic to dynamic and have intermittent links and fluid topology. While it is believed that ad hoc mesh network would be most suitable for UAV networks yet the architecture of multi-UAV networks has been an understudied area. Software defined networking (SDN) could facilitate flexible deployment and management of new services and help reduce cost, increase security and availability in networks. Routing demands of UAV networks go beyond the needs of MANETS and VANETS. Protocols are required that would adapt to high mobility, dynamic topology, intermittent links, power constraints, and changing link quality. UAVs may fail and the network may get partitioned making delay and disruption tolerance an important design consideration. Limited life of the node and dynamicity of the network lead to the requirement of seamless handovers, where researchers are looking at the work done in the areas of MANETs and VANETs, but the jury is still out. As energy supply on UAVs is limited, protocols in various layers should contribute toward greening of the network. This paper surveys the work done toward all of these outstanding issues, relating to this new class of networks, so as to spur further research in these areas.

Survey of Important Issues in UAV Communication Networks

Summary Although establishing correct and efficient routes is an important design issue in mobile ad hoc networks (MANETs), a more challenging goal is to provide energy efficient routes because mobile nodes’ operation time is the most critical limiting factor. This article surveys and classifies the energy-aware routing protocols proposed for MANETs. They minimize either the active communication energy required to transmit or receive packets or the inactive energy consumed when a mobile node stays idle but listens to the wireless medium for any possible communication requests from other nodes. Transmission power control approach and load distribution approach belong to the former category, and sleep/power-down mode approach belongs to the latter category. While it is not clear whether any particular algorithm or a class of algorithms is the best for all scenarios, each protocol has definite advantages/disadvantages and is well suited for certain situations. The purpose of this paper is to facilitate the research efforts in combining the existing solutions to offer a more energy efficient routing mechanism. Copyright # 2003 John Wiley & Sons, Ltd.

/pdf/energy-efficient-routing-protocols-for-mobile-ad-hoc-5far04s136.pdf

Energy Efficient Routing Protocols for Mobile Ad Hoc Networks

As mobile computing requires more computation as well as communication activities, energy efficiency becomes the most critical issue for battery-operated mobile devices. Specifically, in ad hoc networks where each node is responsible for forwarding neighbor nodes' data packets, care has to be taken not only to reduce the overall energy consumption of all relevant nodes but also to balance individual battery levels. Unbalanced energy usage will result in earlier node failure in overloaded nodes, and in turn may lead to network partitioning and reduced network lifetime. This paper presents a new routing algorithm, called local energy-aware routing (LEAR), which achieves a trade-off between balanced energy consumption and shortest routing delay, and at the same time avoids the blocking and route cache problems. Our performance study based on GloMoSim simulator shows that compared to DSR the proposed LEAR improves the energy balance 1.0-35% depending on node mobility.

https://academic.csuohio.edu/yuc/papers/yu_non-blocking-conf.pdf

Non-blocking, localized routing algorithm for balanced energy consumption in mobile ad hoc networks

Wireless sensor network consists of hundreds to thousands of sensor nodes gathering various data including temperature, sound, location, etc. They have been applied to numerous fields such as healthcare, monitoring system, military, and so forth. It is usually difficult to recharge or replace the sensor nodes which have limited battery capacity. Energy efficiency is thus a primary issue in maintaining the network. In this paper we propose an efficient cluster head selection method using K-means algorithm to maximize the energy efficiency of wireless sensor network. It is based on the concept of finding the cluster head minimizing the sum of Euclidean distances between the head and member nodes. Computer simulation shows that the proposed approach allows better performance than the existing hierarchical routing protocols such as LEACH and HEED in terms of network lifetime.

A Novel Cluster Head Selection Method based on K-Means Algorithm for Energy Efficient Wireless Sensor Network

UbiComp 2008, the Tenth International Conference on Ubiquitous computing, is the premier forum for the presentation of research results in all areas relating to the design, implementation, deployment and evaluation of ubiquitous computing technologies. The conference brings together leading researchers, from a variety of disciplines, perspectives and geographical areas, who have been exploring the implications of computing as it moves beyond the desktop and becomes increasingly interwoven into the fabrics of our lives.

A total of 226 submissions---160 full papers and 66 notes---were evaluated by our international Program Committee, composed of 31 of the leading researchers in the field of ubiquitous computing. Each submission was reviewed by two members of the program committee and two or more external reviewers, and after an online discussion phase 80 papers were chosen for consideration at a 2-day PC meeting. Each of these was evaluated by an additional PC member before the meeting. After this rigorous process, a total of 42 submissions---37 full papers and 5 notes---were accepted for publication in these proceedings, representing an overall acceptance rate of 19%. We are pleased to note that the set of accepted papers constitutes the largest number of papers accepted to a UbiComp conference to date.

Proceedings of the 10th international conference on Ubiquitous computing

Multistage interconnection networks (MIN's) have a number of applications in the areas of computer and communication. While several analytical models have been proposed for the performance evaluation of MIN's, they are either not very accurate or too complex to be generalized. The authors propose a new model for evaluating multibuffered MIN's with 2/spl times/2 switching elements. It effectively and realistically models the correlation of packet movements between two adjacent stages as well as subsequent network cycles. As a result, the proposed model is very accurate for any size and traffic conditions of MIN's. It is also simple and can be easily generalized. >

Hee Yong Youn

Papers

Energy Efficient Routing Protocols for Mobile Ad Hoc Networks

Non-blocking, localized routing algorithm for balanced energy consumption in mobile ad hoc networks

A Novel Cluster Head Selection Method based on K-Means Algorithm for Energy Efficient Wireless Sensor Network

Proceedings of the 10th international conference on Ubiquitous computing

Performance analysis of finite buffered multistage interconnection networks