Research has found support for the effectiveness of procedural justice, specifically perceived fairness, in gaining compliance from people with respect to the police and the courts (Sunshine & Tyler, 2003; Tyler, 1984; Tyler, 2001). Further, research has examined the effectiveness in jail-based residential substance abuse treatment (RSAT) programs in reducing recidivism for offenders with substance abuse problems (Bahr, Harris, Strobell, & Taylor, 2012; Eisenberg & Fabelo, 1996; Hiller, Knight, & Simpson, 1999). However, research has yet to test whether procedural justice can impact recidivism for offenders with substance abuse problems and multiple incarcerations. The major focus of this Master’s thesis was to examine whether 78 participants in the 90-day jail-based RSAT program known as Starting Treatment and Recovery Today (START) were less likely to be rearrested after release from jail if they felt they were treated fairly by the jail staff. Bivariate analyses were conducted on survey data and official criminal records. The findings suggest that perceived fairness of the jail staff was not related to post-program recidivism. Moreover, the results indicate that offenders with more extensive criminal histories were more likely to recidivate. Recommendations for future research and the implications of the findings are discussed.

The use of relays is seen as a promising way to extend cell coverage and increase rates in LTE Advanced networks. Instead of increasing the number of base stations (BS), relays with lower cost could provide similar gains. A relay will have a wireless link to the closest BS as only connection to the core network and will cover areas close to the cell edge or other areas with limited rates. Performing transmissions in several hops (BS-relay & relay-user) requires more radio resources than using direct transmission. This thesis studies how the available radio resources should be allocated between relays and users in order to maximize throughput and/or fairness. Time and frequency multiplexed backhaul is investigated under a full buffer traffic assumption. It is shown that the system will be backhaul limited and that the two ways of multiplexing will perform equally when maximising throughput and/or fairness. The analysis results in a set of throughput/fairness suboptimal solutions, dependant on how many relays are used per cell. The results are verified by simulations, which also show the limiting effects on throughput caused by interference between relays. It is also analysed how the resource allocation should be done given non-fullbuffer traffic. A resource allocation that minimises packet delay given a certain number of relays per cell is presented. The analysis is based on queuing theory. Finally some different schedulers and their suitability for relay networks are discussed. Simulation results are shown, comparing the throughput and fairness of Round Robin, Weighted Round Robin, Proportional Fairness and Weighted Proportional Fairness schemes. It is shown that allocating the resource among the relays according to the number of users served by the relays improves the fairness.

Multi-hop wireless networks based on 802. 11 are being used more widely as an alternative technology for last-mile broadband Internet access. Their benefits include ease of deployment and lower cost. Such networks are not without problems. Current research on such networks aims at a number of challenges, including overcoming capacity limitation and poor fairness. <br /><br /> The focus of our research is for achieving fairness in multi-channel multi-hop wireless networks. First, we review the literature for different methods for representing link-contention areas, and the existing single-channel fairness computational model. Second, we generalize the fairness constraints applied to each link-contention area, defined in the existing single-channel fairness reference model, to multi-channel models. Third, by adopting the concepts of link-usage matrix and medium-usage matrix to represent network topology and flow status, and using Collision Domain theory and Clique Graph theory to represent link-contention area, we develop a computational model to compute optimal MAC-layer bandwidth allocated to each flow in a multi-channel multi-hop WMN. We simulate various network configurations to evaluate the performance of the fairness algorithm based on the above computational model in different scenarios. We have found that in the multi-channel environment, our extension to the Collision Domain model generally provides a more accurate estimation of network capacity. Based on this model, we have extended the source-rate-limiting mechanism, which limits the flow rate to its fair share computed by the computational model. Experimental results that validate these findings are presented in this thesis.

Cognitive Radio Networks (CRNs) provide a solution for the spectrum scarcity problem facing the wireless communications community. However, due to the infancy of CRNs, further research is needed before we can truly benefit from CRNs. The basic concept of CRNs relies on utilizing the unused spectrum of a primary network, without interfering with the activity of primary users (PUs). In order to successfully achieve that, users in a CRN has to perform spectrum sensing, spectrum management, spectrum mobility, and spectrum sharing. The latter, which is the focus of our research, deals with how secondary users (SUs) share the unused spectrum. Furthermore, to be able to utilize CRNs in practical applications, a certain level of quality-of-service (QoS) should be guaranteed to SUs in such networks. QoS requirements vary according to the application. Interested in voice communications, we propose a packet scheduling scheme that orders the SUs' transmissions according to the packet dropping rate and the number of packets queued waiting for transmission. Two medium access control (MAC) layer protocols, based on the mentioned scheduling scheme, are proposed for a centralized CRN. In addition, the scheduling scheme is adapted for a distributed CRN, by introducing a feature that allows SUs to organize access to the available spectrum without the need for a central unit. Finally, extensive simulation based experiments are carried out to evaluate the proposed protocols and compare their performance with that of other MAC protocols designed for CRNs. These results reflect the effectiveness of our proposed protocols to guarantee the required QoS for voice packet transmission, while maintaining fairness among SUs in a CRN.

The Internet has been designed as a best-effort network, which does not provide any additional services to applications using the network. Overlay networks, which form an application layer network on top of the underlying Internet, have emerged as popular means to provide specific services and greater control to applications. Overlay networks offer a wide range of services, including content distribution, multicast and multimedia streaming. In my thesis, I focus on overlay networks for content distribution, used by applications such as bulk data transfer, file sharing and web retrieval. I first investigate the construction of such overlay networks by studying the bootstrapping functionality in an example network (the Gnutella peer-to-peer system). This study comprises the analysis and performance measurements of Gnutella servents and measurement of the GWebCache system that helps new peers find existing peers on the Gnutella network. Next, I look at fairness issues due to the retrieval of data at a client in the form of multipoint-to-point sessions, formed due to the use of content distribution networks. A multipoint-to-point session comprises multiple connections from multiple servers to a single client over multiple paths, initiated to retrieve a single application-level object. I investigate fairness of rate allocation from a session point of view, and propose fairness definitions and algorithms to achieve these definitions. Finally, I consider the problem of designing an overlay network for content distribution, which is fair to competing overlay networks, while maximizing the total end-to-end throughput of the data it carries. As a first step, I investigate this design problem for a single path in an Overlay-TCP network. I propose two schemes that dynamically provision the number of TCP connections on each hop of an Overlay-TCP path to maximize the end-to-end throughput using few extraneous connections. Next, I design an Overlay-TCP network, with the secondary goal of intra-overlay network fairness. I propose four schemes for deciding the number of TCP connections to be used on each overlay hop. I show that one can vary the proportion of sharing between competing overlay networks by varying the maximum number of connections allowed on overlay hops in each competing network.

Due to the access to international financial market is open and globalization is inevitable, the fluctuation of financial market and the competition among banks are getting fierce. Emotion is an essential part of a bank employee¡¦ job and it is closely related to working pressure. Therefore, this paper is to investigate whether working pressure will affect job satisfaction and then affect the tendency of resignation. Based on the research motives, the purposes of this research are as follows: 1. To understand the current situation of financial employees¡¦ job satisfaction factors and resignation tendency. 2. To investigate how job satisfaction factors are related to resignation tendency. 3. This paper provides companies reference of human resource development such as how to reduce resignation intention in order to cut unnecessary recruit cost. Conclusion¡GBased on the result of simple regression analysis,¡uworking pressure¡v,¡udegree of satisfaction to salary and benefits¡v,¡ucommitment to organization¡v and ¡uassignment fairness¡vindeed influence working satisfaction. In other words, the lower working pressure an employee has, the higher degree of working satisfaction one has; the higher degree of satisfaction to salary and benefits, commitment to organization and assignment fairness one has, the higher degree of working satisfaction one has. Suggestions: 1.Raise employees¡¦ commitment to organization in order to recruit elites and reduce the labor turnover rate. 2.The reward system has to be quantified. KEY WORLD¡Gworking pressure¡Bdegree of satisfaction to salary and benefits¡B commitment to organization¡Bassignment fairness¡Bresignation intention¡Bworking satisfaction

In this paper, we consider the code division multiple access of the multiuser cooperative network system, all sources transmit signals using assigned spreading waveforms in first phase, and all relays transmit precoded signals using a common spreading waveform to help send signals to all destinations in second phase, in order to improve the performance. In this paper, we proposed the precoding strategy of relay point and the decoding strategy of destination point; at first we use the zero-forcing to eliminate the multi-user interferen- ce at the destination, and then joint design of the precoding vector at relay point and the decoding vector at destination point to achieve different optimization objectives. In this paper, we consider the power constraints to optimal the average SNR for the precoding vector and decoding vector, but the precoding vector favors the source-destination pairs with better channel quality in this condition, we also present the design of fairness, joint design of the precoding vector and the decoding vector to make the worst SNR can have the best signal-to-noise ratio after the design, and also consider the power constrain.

Algorithms in message-passing distributed systems often require partial synchrony to tolerate crash failures. Informally, partial synchrony refers to systems where timing bounds on communication and computation may exist, but the knowledge of such bounds is limited. Traditionally, the foundation for the theory of partial synchrony has been real time: a time base measured by counting events external to the system, like the vibrations of Cesium atoms or piezoelectric crystals. Unfortunately, algorithms that are correct relative to many real-time based models of partial synchrony may not behave correctly in empirical distributed systems. For example, a set of popular theoretical models, which we call M_*, assume (eventual) upper bounds on message delay and relative process speeds, regardless of message size and absolute process speeds. Empirical systems with bounded channel capacity and bandwidth cannot realize such assumptions either natively, or through algorithmic constructions. Consequently, empirical deployment of the many M_*-based algorithms risks anomalous behavior. As a result, we argue that real time is the wrong basis for such a theory. Instead, the appropriate foundation for partial synchrony is fairness: a time base measured by counting events internal to the system, like the steps executed by the processes. By way of example, we redefine M_* models with fairness-based bounds and provide algorithmic techniques to implement fairness-based M_* models on a significant subset of the empirical systems. The proposed techniques use failure detectors — system services that provide hints about process crashes — as intermediaries that preserve the fairness constraints native to empirical systems. In effect, algorithms that are correct in M_* models are now proved correct in such empirical systems as well. Demonstrating our results requires solving three open problems. (1) We propose the first unified mathematical framework based on Timed I/O Automata to specify empirical systems, partially synchronous systems, and algorithms that execute within the aforementioned systems. (2) We show that crash tolerance capabilities of popular distributed systems can be denominated exclusively through fairness constraints. (3) We specify exemplar system models that identify the set of weakest system models to implement popular failure detectors.

It often appears some cognitive conflicts among the citizens¡¦ when evaluating the policy outcomes performance about Dengue fever prevention, since existed some characteristics in the input and outcome dimension, it include multi-involvers, multi-goals, multi-values and subjective judgement(Wang Ming-Shen and Chen Cheng-Liaou, 2004: 11). We taked the unfairness measurement approach of the Information Integration Theory (IIT) to explore the policy outcome performance about Dengue fever prevention. In this way, we constructed an algebraic model, namely ¡§Dengue Fever Basic Unfairness Measurement Model,¡¨ with accrute empirical test and validity criteria. According to the way of the factorial graph patterns and statistical interaction test of the model, we may analyze and collect these multiple information of policy outcomes(Farkas, 1991: 61 ; Anderson, 1996: 33). We obtained some important findings, include: 1.The citizen integrated the information of Dengue fever prevention outcomes by ¡¥averging¡¦ model, the experimental data support the mode and it had important policy implications. 2.The effort(implicit factor) of the governer¡¦s devoted to prevention tasks was more than the budget expendures(explicit factor) was the most important factor of outcome performance evaluation, and this had important cognitive implication. 3.According to the differences of the information qulity from the Dengue fever prevention, there was an interpersonal salience about the evaluation of the policy outcome performance. 4.It showed that highly corelation between the habitant¡¦s life modes and the prevention outcomes performance, this implied that the implicit social meaning of Dengue fever prevention were interpersonal interaction. 5.The citizen¡¦s perception of the unfairness measurement for the policy outcome performance of Dengue fever prevention were not satisfaction and sensitive to the interpersonal unfairness situation.

This study is exploring on the taxman¡¦s conception on the relationship between the perception on fairness of job promotion, political awareness of the job promotion and the promise of the organization when the organization conducts job promotion. The study is to achieve the purpose of providing a reference for the development and organizing of the human resources for the civil servant department. This study is based on analysis of documents and questionnaires from taxman of Kaoshiung Notional Tax Administration. Research changing facts include: Personal background, the perception on fairness of job promotion, political awareness of the job promotion and the promise of the organization. The number of questionnaire handed out is 541, and the number of questionnaire received is 448. After eliminating of 59 invalided questionnaires, the total number of the valid questionnaire is 389. Receiving rate is 72.46%. The questionnaire data is calculated and analyzed by statistic software of SPPSS.1 Chinese version and AMOS 5.0 version. The important findings are the following: 1¡BThe taxman¡¦s average rate on the perception on fairness of job promotion, political awareness of job promotion and the promise of the organization is above average level. 2¡BThe changing fact of Taxman¡¦s personnel background will affect their opinions on the perception on fairness of job promotion, political awareness of job promotion and the promise of the organization. 3¡BThe political awareness of job promotion has prominent negative influence on the perception on fairness of job promotion. 4¡BThe organizational fair conception has prominent positive influence on the promise of the organization. 5¡BThe political awareness of the job promotion has prominent negative influence on the promise of the organization.