Business statistics using EXCEL and SPSS

'Takes the challenging and makes it understandable. The book contains useful advice on the application of statistics to a variety of contexts and shows how statistics can be used by managers in their work.' - Dr Terri Byers, Assistant Professor, University Of New Brunswick, Canada A book about introductory quantitative analysis for business students designed to be read by first- and second-year students on a business studies degree course that assumes little or no background in mathematics or statistics. Based on extensive knowledge and experience in how people learn and in particular how people learn mathematics, the authors show both how and why quantitative analysis is useful in the context of business and management studies, encouraging readers to not only memorise the content but to apply learning to typical problems. Fully up-to-date with comprehensive coverage of IBM SPSS and Microsoft Excel software, the tailored examples illustrate how the programmes can be used, and include step-by-step figures and tables throughout. A range of ‘real world’ and fictional examples, including "The Ballad of Eddie the Easily Distracted" and "Esha's Story" help bring the study of statistics alive. A number of in-text boxouts can be found throughout the book aimed at readers at varying levels of study and understanding •Back to Basics for those struggling to understand, explain concepts in the most basic way possible - often relating to interesting or humorous examples •Above and Beyond for those racing ahead and who want to be introduced to more interesting or advanced concepts that are a little bit outside of what they may need to know •Think it over get students to stop, engage and reflect upon the different connections between topics A range of online resources including a set of data files and templates for the reader following in-text examples, downloadable worksheets and instructor materials, answers to in-text exercises and video content compliment the book.

Enhancement of wireless networks with heterogeneous antennas

In recent years, wireless communication infrastructures have been widely deployed for both personal and business applications. IEEE 802.11 series Wireless Local Area Network (WLAN) standards attract lots of attention due to their low cost and high data rate. Wireless ad hoc networks which use IEEE 802.11 standards are one of hot spots of recent network research. Designing appropriate Media Access Control (MAC) layer protocols is one of the key issues for wireless ad hoc networks. ^ Existing wireless applications typically use omni-directional antennas. When using an omni-directional antenna, the gain of the antenna in all directions is the same. Due to the nature of the Distributed Coordination Function (DCF) mechanism of IEEE 802.11 standards, only one of the one-hop neighbors can send data at one time. Nodes other than the sender and the receiver must be either in idle or listening state, otherwise collisions could occur. The downside of the omni-directionality of antennas is that the spatial reuse ratio is low and the capacity of the network is considerably limited. ^ It is therefore obvious that the directional antenna has been introduced to improve spatial reutilization. As we know, a directional antenna has the following benefits. It can improve transport capacity by decreasing interference of a directional main lobe. It can increase coverage range due to a higher SINR (Signal Interference to Noise Ratio), i.e., with the same power consumption, better connectivity can be achieved. And the usage of power can be reduced, i.e., for the same coverage, a transmitter can reduce its power consumption. ^ To utilizing the advantages of directional antennas, we propose a relay-enabled MAC protocol. Two relay nodes are chosen to forward data when the channel condition of direct link from the sender to the receiver is poor. The two relay nodes can transfer data at the same time and a pipelined data transmission can be achieved by using directional antennas. The throughput can be improved significant when introducing the relay-enabled MAC protocol. ^ Besides the strong points, directional antennas also have some explicit drawbacks, such as the hidden terminal and deafness problems and the requirements of retaining location information for each node. Therefore, an omni-directional antenna should be used in some situations. The combination use of omni-directional and directional antennas leads to the problem of configuring heterogeneous antennas, i e., given a network topology and a traffic pattern, we need to find a tradeoff between using omni-directional and using directional antennas to obtain a better network performance over this configuration. ^ Directly and mathematically establishing the relationship between the network performance and the antenna configurations is extremely difficult, if not intractable. Therefore, in this research, we proposed several clustering-based methods to obtain approximate solutions for heterogeneous antennas configuration problem, which can improve network performance significantly. ^ Our proposed methods consist of two steps. The first step (i.e., clustering links) is to cluster the links into different groups based on the matrix-based system model. After being clustered, the links in the same group have similar neighborhood nodes and will use the same type of antenna. The second step (i.e., labeling links) is to decide the type of antenna for each group. For heterogeneous antennas, some groups of links will use directional antenna and others will adopt omni-directional antenna. Experiments are conducted to compare the proposed methods with existing methods. Experimental results demonstrate that our clustering-based methods can improve the network performance significantly. ^

Resource management and optimization in wireless mesh networks

A wireless mesh network is a mesh network implemented over a wireless network system such as wireless LANs. Wireless Mesh Networks(WMNs) are promising for numerous applications such as broadband home networking, enterprise networking, transportation systems, health and medical systems, security surveillance systems, etc. Therefore, it has received considerable attention from both industrial and academic researchers. This dissertation explores schemes for resource management and optimization in WMNs by means of network routing and network coding.^ In this dissertation, we propose three optimization schemes. (1) First, a triple-tier optimization scheme is proposed for load balancing objective. The first tier mechanism achieves long-term routing optimization, and the second tier mechanism, using the optimization results obtained from the first tier mechanism, performs the short-term adaptation to deal with the impact of dynamic channel conditions. A greedy sub-channel allocation algorithm is developed as the third tier optimization scheme to further reduce the congestion level in the network. We conduct thorough theoretical analysis to show the correctness of our design and give the properties of our scheme. (2) Then, a Relay-Aided Network Coding scheme called RANC is proposed to improve the performance gain of network coding by exploiting the physical layer multi-rate capability in WMNs. We conduct rigorous analysis to find the design principles and study the tradeoff in the performance gain of RANC. Based on the analytical results, we provide a practical solution by decomposing the original design problem into two sub-problems, flow partition problem and scheduling problem. (3) Lastly, a joint optimization scheme of the routing in the network layer and network coding-aware scheduling in the MAC layer is introduced. We formulate the network optimization problem and exploit the structure of the problem via dual decomposition. We find that the original problem is composed of two problems, routing problem in the network layer and scheduling problem in the MAC layer. These two sub-problems are coupled through the link capacities. We solve the routing problem by two different adaptive routing algorithms. We then provide a distributed coding-aware scheduling algorithm. According to corresponding experiment results, the proposed schemes can significantly improve network performance.^

Evolução dos sistemas de falhas de borda do Rifte Potiguar com base em curvas de crescimento de falhas

The discussion about rift evolution in the Brazilian Equatorial margin during the South America-Africa breakup in the Jurassic/Cretaceous has been focused in many researches. But rift evolution based on development and growth of faults has not been well explored. In this sense, we investigated the Cretaceous Potiguar Basin in the Equatorial margin of Brazil to understand the geometry of major faults and the influence of crustal heterogeneity and preexisting structural fabric in the evolution of the basin internal architecture. Previous studies pointed out that the rift is an asymmetrical half-graben elongated along the NE-SW direction. We used 2D seismic, well logs and 3D gravity modeling to analyze four major border fault segments and determine their maximum displacement (Dmax) and length (L) ratio in the Potiguar Rift. We constrained the 3D gravity modeling with well data and the interpretation of seismic sections. The difference of the fault displacement measured in the gravity model is in the order of 10% compared to seismic and well data. The fault-growth curves allowed us to divide the faulted rift border into four main fault segments, which provide roughly similar Dmax/L ratios. Fault-growth curves suggest that a regional uniform tectonic mechanism influenced growth of the rift fault segments. The variation of the displacements along the fault segments indicates that the fault segments were formed independently during rift initiation and were linked by hard and soft linkages. The latter formed relay ramps. In the interconnection zones the Dmax/L ratios are highest due to interference of fault segment motions. We divided the evolution of the Potiguar Rift into five stages based on these ratios and correlated them with the major tectonic stages of the breakup between South America and Africa in Early Cretaceous.

Evolução dos sistemas de falhas de borda do Rifte Potiguar com base em curvas de crescimento de falhas

The discussion about rift evolution in the Brazilian Equatorial margin during the South America-Africa breakup in the Jurassic/Cretaceous has been focused in many researches. But rift evolution based on development and growth of faults has not been well explored. In this sense, we investigated the Cretaceous Potiguar Basin in the Equatorial margin of Brazil to understand the geometry of major faults and the influence of crustal heterogeneity and preexisting structural fabric in the evolution of the basin internal architecture. Previous studies pointed out that the rift is an asymmetrical half-graben elongated along the NE-SW direction. We used 2D seismic, well logs and 3D gravity modeling to analyze four major border fault segments and determine their maximum displacement (Dmax) and length (L) ratio in the Potiguar Rift. We constrained the 3D gravity modeling with well data and the interpretation of seismic sections. The difference of the fault displacement measured in the gravity model is in the order of 10% compared to seismic and well data. The fault-growth curves allowed us to divide the faulted rift border into four main fault segments, which provide roughly similar Dmax/L ratios. Fault-growth curves suggest that a regional uniform tectonic mechanism influenced growth of the rift fault segments. The variation of the displacements along the fault segments indicates that the fault segments were formed independently during rift initiation and were linked by hard and soft linkages. The latter formed relay ramps. In the interconnection zones the Dmax/L ratios are highest due to interference of fault segment motions. We divided the evolution of the Potiguar Rift into five stages based on these ratios and correlated them with the major tectonic stages of the breakup between South America and Africa in Early Cretaceous.

Cooperative routing for collision minimization in wireless sensor networks

Cooperative communication has gained much interest due to its ability to exploit the broadcasting nature of the wireless medium to mitigate multipath fading. There has been considerable amount of research on how cooperative transmission can improve the performance of the network by focusing on the physical layer issues. During the past few years, the researchers have started to take into consideration cooperative transmission in routing and there has been a growing interest in designing and evaluating cooperative routing protocols. Most of the existing cooperative routing algorithms are designed to reduce the energy consumption; however, packet collision minimization using cooperative routing has not been addressed yet. This dissertation presents an optimization framework to minimize collision probability using cooperative routing in wireless sensor networks. More specifically, we develop a mathematical model and formulate the problem as a large-scale Mixed Integer Non-Linear Programming problem. We also propose a solution based on the branch and bound algorithm augmented with reducing the search space (branch and bound space reduction). The proposed strategy builds up the optimal routes from each source to the sink node by providing the best set of hops in each route, the best set of relays, and the optimal power allocation for the cooperative transmission links. To reduce the computational complexity, we propose two near optimal cooperative routing algorithms. In the first near optimal algorithm, we solve the problem by decoupling the optimal power allocation scheme from optimal route selection. Therefore, the problem is formulated by an Integer Non-Linear Programming, which is solved using a branch and bound space reduced method. In the second near optimal algorithm, the cooperative routing problem is solved by decoupling the transmission power and the relay node se- lection from the route selection. After solving the routing problems, the power allocation is applied in the selected route. Simulation results show the algorithms can significantly reduce the collision probability compared with existing cooperative routing schemes.

Janet Guthrie at the Trentonian 200

General note: Title and date provided by Bettye Lane.

Harness race driver Patti Ahneman

General note: Title and date provided by Bettye Lane.

Introduction to fans with #44 Dick Simon, Janet Guthrie, and #86 Al Loquasto Jr. at the Trentonian 200

General note: Title and date provided by Bettye Lane.

Janet Guthrie quit after 79 laps because of mechanical failure

General note: Title and date provided by Bettye Lane.

Janet Guthrie, professional race car driver

General note: Title and date provided by Bettye Lane.

Track official at car race

General note: Title and date provided by Bettye Lane.

Janet Guthrie getting ready for Trentonian 200

General note: Title and date provided by Bettye Lane.

Harness race drivers

General note: Title and date provided by Bettye Lane.

Harness race driver

General note: Title and date provided by Bettye Lane.