<p> This thesis seeks to describe and explain the spatial pattern of urban residential blight. The empirical analysis is limited to one study area; that of the Chicago metropolitan area. The data are U.S. Census data for census tracts in 1940, 1950, and 1960. Following a review of pertinent literature, an attempt is made to conceptualise the process that generates residential blight. From this conceptual framework, a number of hypotheses are developed concerning the relationship between residential blight and selected socio-economic variables. Other relationships are derived from an interpretation of maps of residential blight in the Chicago area for the different time periods. The hypotheses are tested using such multivariate procedures as principal components analysis, and regression and correlation analysis. The thesis also contains an application of the Blalock-Simon procedure for causal modelling to the Chicago data. The findings of the empirical analysis are related to present knowledge concerning urban residential blight. </p> / Thesis / Doctor of Philosophy (PhD)

This paper will assess the effectiveness of the No Child Left Behind Act (NCLB) in the state of Texas. In order to do this, we examine how students’ performance levels from failing schools respond to sanctions imposed by the NCLB accountability system. Additionally, we explore achievement gap trends between white and minority students that attend these failing schools. By taking advantage of campus and year fixed effects, as well as controlling for student demographic characteristics, we find that sanctions employed by NCLB have had a statistically significant positive impact on academic achievement gains for all students. However, our results also indicate that these sanctions have effectively widened the achievement gaps between the white and minority students they affect. Given that the federal government spends upwards of 14 billion dollars per year to fund NCLB, this paper offers new insight to an economically important issue that is relevant to all citizens of the United States.

The voluntary association is the mediate between society and individuals; it serves as a prime engine for social changes. Therefore, it is very important to find out who the voluntary association participants are. Previous research has focused primarily on demographic attributes of voluntary association participants. In addition to the demographic factors, this study investigates the effects of job characteristics, work-related attitudes, perceptions of social inequality, and resource constrains on the probability of participation. Based on 1996 ¡§ Taiwan Social Change Survey,¡¨ this study uses logistic regression to model the determinants of participation in voluntary associations of more than 2000 respondents. The result shows that job satisfaction is negatively associated with participation rate and job stability has a positive effect on participation. With respect to the perceived causes of social inequality, situational attribution is positively correlated with probability of participation. Finally, respondents with lower family responsibilities and higher income are more likely to participate in voluntary association.

This thesis provides a discussion on some analytical and empirical models of online auctions. The objective is to provide an alternative framework for analyzing online auctions, and to characterize the distribution of intermediate prices. Chapter 1 provides a mathematical formulation of the eBay auction format and background to the data used in the empirical analysis. Chapter 2 analyzes policies for optimally disposing inventory using online auctions. It is assumed a seller has a fixed number of items to sell using a sequence of, possibly overlapping, single-item auctions. The decision the seller must make is when to start each auction. The decision involves a trade-off between a holding cost for each period an item remains unsold, and a cannibalization effect among competing auctions. Consequently the seller must trade-off the expected marginal gain for the ongoing auctions with the expected marginal cost of the unreleased items by further deferring their release. The problem is formulated as a discrete time Markov Decision Problem. Conditions are derived to ensure that the optimal release policy is a control limit policy in the current price of the ongoing auctions. Chapter 2 focuses on the two item case which has sufficient complexity to raise challenging questions. An underlying assumption in Chapter 2 is that the auction dynamics can be captured by a set of transition probabilities. Chapter 3 shows with two fixed bidding strategies how the transition probabilities can be derived for a given auction format and bidder arrival process. The two specific bidding strategies analyzed are when bidders bid: 1) a minimal increment, and 2) their true valuation. Chapters 4 and 5 provides empirical analyzes of 4,000 eBay auctions conducted by Dell. Chapter 4 provides a statistical model where over discrete time periods, prices of online auctions follow a zero-inflated gamma distribution. Chapter 5 provides an analysis of the 44,000 bids placed in the auctions, based on bids following a gamma distribution. Both models presented in Chapters 4 and 5 are based on conditional probabilities given the price and elapsed time of an auction, and certain parameters of the competing auctions. Chapter 6 concludes the thesis with a discussion of the main results and possible extensions.

Wireless sensor networks are the collection of wireless nodes that are deployed to monitor certain phenomena of interest. Once the node takes measurements it transmits to a base station over a wireless channel. The base station collects data from all the nodes and do further analysis. To save energy, it is often useful to build clusters, and the head of each cluster communicates with the base station. Initially, we do the simulation analysis of the Zigbee networks where few nodes are more powerful than the other nodes. The results show that in the mobile heterogeneous sensor networks, due to phenomenon orphaning and high cost of route discovery and maintenance, the performance of the network degrades with respect to the homogeneous network. The core of this thesis is to empirically analyze the sensor network. Due to its resource constraints, low power wireless sensor networks face several technical challenges. Many protocols work well on simulators but do not act as we expect in the actual deployments. For example, sensors physically placed at the top of the heap experience Free Space propagation model, while the sensors which are at the bottom of the heap have sharp fading channel characteristics. In this thesis, we show that impact of asymmetric links in the wireless sensor network topology and that link quality between sensors varies consistently. We propose two ways to improve the performance of Link Quality Indicator (LQI) based algorithms in the real asymmetric link sensor networks. In the first way, network has no choice but to have some sensors which can transmit over the larger distance and become cluster heads. The number of cluster heads can be given by Matérn Hard-Core process. In the second solution, we propose HybridLQI which improves the performance of LQI based algorithm without adding any overhead on the network. Later, we apply theoretical clustering approaches in sensor network to real world. We deploy Matérn Hard Core Process and Max-Min cluster Formation heuristic on real Tmote nodes in sparse as well as highly dense networks. Empirical results show clustering process based on Matérn Hard Core Process outperforms Max-Min Cluster formation in terms of the memory requirement, ease of implementation and number of messages needed for clustering. Finally, using Absorbing Markov chain and measurements we study the performance of load balancing techniques in real sensor networks.

This thesis provides a discussion on some analytical and empirical models of online auctions. The objective is to provide an alternative framework for analyzing online auctions, and to characterize the distribution of intermediate prices. Chapter 1 provides a mathematical formulation of the eBay auction format and background to the data used in the empirical analysis. Chapter 2 analyzes policies for optimally disposing inventory using online auctions. It is assumed a seller has a fixed number of items to sell using a sequence of, possibly overlapping, single-item auctions. The decision the seller must make is when to start each auction. The decision involves a trade-off between a holding cost for each period an item remains unsold, and a cannibalization effect among competing auctions. Consequently the seller must trade-off the expected marginal gain for the ongoing auctions with the expected marginal cost of the unreleased items by further deferring their release. The problem is formulated as a discrete time Markov Decision Problem. Conditions are derived to ensure that the optimal release policy is a control limit policy in the current price of the ongoing auctions. Chapter 2 focuses on the two item case which has sufficient complexity to raise challenging questions. An underlying assumption in Chapter 2 is that the auction dynamics can be captured by a set of transition probabilities. Chapter 3 shows with two fixed bidding strategies how the transition probabilities can be derived for a given auction format and bidder arrival process. The two specific bidding strategies analyzed are when bidders bid: 1) a minimal increment, and 2) their true valuation. Chapters 4 and 5 provides empirical analyzes of 4,000 eBay auctions conducted by Dell. Chapter 4 provides a statistical model where over discrete time periods, prices of online auctions follow a zero-inflated gamma distribution. Chapter 5 provides an analysis of the 44,000 bids placed in the auctions, based on bids following a gamma distribution. Both models presented in Chapters 4 and 5 are based on conditional probabilities given the price and elapsed time of an auction, and certain parameters of the competing auctions. Chapter 6 concludes the thesis with a discussion of the main results and possible extensions.

This thesis provides a discussion on some analytical and empirical models of online auctions. The objective is to provide an alternative framework for analyzing online auctions, and to characterize the distribution of intermediate prices. Chapter 1 provides a mathematical formulation of the eBay auction format and background to the data used in the empirical analysis. Chapter 2 analyzes policies for optimally disposing inventory using online auctions. It is assumed a seller has a fixed number of items to sell using a sequence of, possibly overlapping, single-item auctions. The decision the seller must make is when to start each auction. The decision involves a trade-off between a holding cost for each period an item remains unsold, and a cannibalization effect among competing auctions. Consequently the seller must trade-off the expected marginal gain for the ongoing auctions with the expected marginal cost of the unreleased items by further deferring their release. The problem is formulated as a discrete time Markov Decision Problem. Conditions are derived to ensure that the optimal release policy is a control limit policy in the current price of the ongoing auctions. Chapter 2 focuses on the two item case which has sufficient complexity to raise challenging questions. An underlying assumption in Chapter 2 is that the auction dynamics can be captured by a set of transition probabilities. Chapter 3 shows with two fixed bidding strategies how the transition probabilities can be derived for a given auction format and bidder arrival process. The two specific bidding strategies analyzed are when bidders bid: 1) a minimal increment, and 2) their true valuation. Chapters 4 and 5 provides empirical analyzes of 4,000 eBay auctions conducted by Dell. Chapter 4 provides a statistical model where over discrete time periods, prices of online auctions follow a zero-inflated gamma distribution. Chapter 5 provides an analysis of the 44,000 bids placed in the auctions, based on bids following a gamma distribution. Both models presented in Chapters 4 and 5 are based on conditional probabilities given the price and elapsed time of an auction, and certain parameters of the competing auctions. Chapter 6 concludes the thesis with a discussion of the main results and possible extensions. / Business, Sauder School of / Graduate

The aim of this thesis is to empirically analyze the behavior of terrorist groups. In this work we tested the assumption of the model of rational choice in terms of terrorism. The empirical section combines theoretical predictions with observed facts and shows the terrorists as rational actors acting under uncertainty. The data used in the analysis orginate from databases GTD and RDWTI. Mean-variance analysis of portfolios of real attack of terrorist organizations suggests their ability to effectively optimize their activity and to reduce the risks to which they are exposed. Terrorists thus appears as rational agents able to react quickly to external influences. This largely affects the resulting impact of counter-terrorism measures taken when selectively targeted measures may lead to a mere transfer of terrorist activity to another destination.

Les réseaux de capteurs sans fil sont une collection de nœuds non connectés qui sont installés pour la détection de certains phénomènes intéressants. Après avoir pris des mesures un capteur sans fil retransmet ces mesures à la station de base. La station de base collecte les données de tous les capteurs et les analyse. Pour économiser l’énergie il est souvent utilise de grouper les capteurs en clusters, chaque cluster ayant une tête de cluster qui communique avec la station de base. Au début, on commence par analyser la simulation des réseaux Zigbee où il y a quelques nœuds qui transmettent avec différentes puissances. Les résultats montrent que dans les réseaux de capteurs mobiles et hétérogènes et à cause du phénomène d’isolation des nœuds et du coût très élevé du routage et la maintenance, les performances sont moins bonnes que celles des réseaux homogènes. Le but principal de cette thèse est de faire une analyse empirique des réseaux de capteurs. A cause de leurs ressources limitées les réseaux de capteurs doivent faire face à plusieurs défis techniques. Beaucoup de protocoles fonctionnent très bien dans les simulateurs mais pas aussi bien en implémentation réelle. Par exemple, les capteurs déposés sur un objet élevé subissent moins d’atténuation que les autres capteurs placés sur le sol. Dans cette thèse, on montre qu’il y a un impact des liens asymétriques sur la topologie des réseaux de capteurs sans fil et que la qualité des liens (LQI) varie en permanence. On propose deux méthodes pour améliorer les performances des algorithmes basés sur la qualité des liens des réseaux de capteurs avec des liens asymétriques. Dans la première méthode, le réseau n’a pas d’autre choix que d’avoir des nœuds qui transmettent à des grandes distances et deviennent des clusters Head. Le nombre de clusters Head peut être donné par Matérn Hard-core process. Dans la seconde méthode, on propose HybridLQI qui améliore les algorithmes basés sur LQI sans ajouter des entêtes au réseau. Ensuite, on applique les approches de clustérisassions théoriques sur le réseau de capteurs réel. On applique Matérn Hard Core process et Max-Min heuristique de formation des clusters sur des nœuds «Tmote » dans des réseaux denses et des réseaux de faible densité. Les résultats empiriques ont montré la supériorité de Matérn sur Max-Min dans les besoins d’espace mémoire, la simplicité de l’implémentation et le nombre de messages de signalisation. Enfin, en utilisant les chaînes de Markov absorbantes et des mesures, on étudie les performances des techniques de la distribution de charge dans des réseaux de capteurs réels / Wireless sensor networks are the collection of wireless nodes that are deployed to monitor certain phenomena of interest. Once the node takes measurements it transmits to a base station over a wireless channel. The base station collects data from all the nodes and do further analysis. To save energy, it is often useful to build clusters, and the head of each cluster communicates with the base station. Initially, we do the simulation analysis of the Zigbee networks where few nodes are more powerful than the other nodes. The results show that in the mobile heterogeneous sensor networks, due to phenomenon orphaning and high cost of route discovery and maintenance, the performance of the network degrades with respect to the homogeneous network. The core of this thesis is to empirically analyze the sensor network. Due to its resource constraints, low power wireless sensor networks face several technical challenges. Many protocols work well on simulators but do not act as we expect in the actual deployments. For example, sensors physically placed at the top of the heap experience Free Space propagation model, while the sensors which are at the bottom of the heap have sharp fading channel characteristics. In this thesis, we show that impact of asymmetric links in the wireless sensor network topology and that link quality between sensors varies consistently. We propose two ways to improve the performance of Link Quality Indicator (LQI) based algorithms in the real asymmetric link sensor networks. In the first way, network has no choice but to have some sensors which can transmit over the larger distance and become cluster heads. The number of cluster heads can be given by Matérn Hard-Core process. In the second solution, we propose HybridLQI which improves the performance of LQI based algorithm without adding any overhead on the network. Later, we apply theoretical clustering approaches in sensor network to real world. We deploy Matérn Hard Core Process and Max-Min cluster Formation heuristic on real Tmote nodes in sparse as well as highly dense networks. Empirical results show clustering process based on Matérn Hard Core Process outperforms Max-Min Cluster formation in terms of the memory requirement, ease of implementation and number of messages needed for clustering. Finally, using Absorbing Markov chain and measurements we study the performance of load balancing techniques in real sensor networks.

In this thesis, we measure the impact of reference semantics on programming and reasoning. We designed a survey to compare how well programmers perform under three different programming paradigms. Two of the paradigms, object-copying and swapping use value semantics, while the third, reference-copying, uses reference semantics. We gave the survey to over 25 people. We recorded number of questions answered correctly in each paradigm and the amount of time it took to answer each question. We looked at the overall results as well as the results within various levels of Java experience. Based on anecdotal evidence from the literature, we expected questions based on value semantics to be easier than questions based on reference semantics. The results did not yield differences that were statistically significant, but they did conform to our general expectations. While further investigation is clearly needed, we believe that this work represents an important first step in the empirical analysis of a topic that has previously only been discussed informally. / Master of Science