A new scheduling method for enhanced quality of experience in LTE systems

In this paper a new approach to the resource allocation and scheduling mechanism that reflects the effect of user's Quality of Experience is presented. The proposed scheduling algorithm is examined in the context of 3GPP Long Term Evolution (LTE) system. Pause Intensity (PI) as an objective and no-reference quality assessment metric is employed to represent user's satisfaction in the scheduler of eNodeB. PI is in fact a measurement of discontinuity in the service. The performance of the scheduling method proposed is compared with two extreme cases: maxCI and Round Robin scheduling schemes which correspond to the efficiency and fairness oriented mechanisms, respectively. Our work reveals that the proposed method is able to perform between fairness and efficiency requirements, in favor of higher satisfaction for the users to the desired level. © VDE VERLAG GMBH.

Four-leg converters with improved common current sharing and selective voltage-quality enhancement for islanded microgrids

Four-leg dc-ac power converters are widely used for the power grids to manage grid voltage unbalance caused by the interconnection of single-phase or three-phase unbalanced loads. These converters can further be connected in parallel to increase the overall power rating. The control of these converters poses a particular challenge if they are placed far apart with no links between them (e.g., in islanded microgrids). This challenge is studied in this paper with each four-leg converter designed to have improved common current sharing and selective voltage-quality enhancement. The common current sharing, including zero sequence component, is necessary since loads are spread over the microgrid and they are hence the common responsibility of all converters. The voltage-quality enhancement consideration should however be more selective since different loads have different sensitivity levels towards voltage disturbances. Converters connected to the more sensitive load buses should therefore be selectively triggered for compensation when voltage unbalances at their protected buses exceed the predefined thresholds. The proposed scheme is therefore different from conventional centralized schemes protecting only a common bus. Simulation and experimental results obtained have verified the effectiveness of the proposed scheme when applied to a four-wire islanded microgrid.

A multi-organisational approach for disaster preparedness and response:the use of optimisation and GIS for facility location, stock pre-positioning, resource allocation and relief distribution

From 1992 to 2012 4.4 billion people were affected by disasters with almost 2 trillion USD in damages and 1.3 million people killed worldwide. The increasing threat of disasters stresses the need to provide solutions for the challenges faced by disaster managers, such as the logistical deployment of resources required to provide relief to victims. The location of emergency facilities, stock prepositioning, evacuation, inventory management, resource allocation, and relief distribution have been identified to directly impact the relief provided to victims during the disaster. Managing appropriately these factors is critical to reduce suffering. Disaster management commonly attracts several organisations working alongside each other and sharing resources to cope with the emergency. Coordinating these agencies is a complex task but there is little research considering multiple organisations, and none actually optimising the number of actors required to avoid shortages and convergence. The aim of the this research is to develop a system for disaster management based on a combination of optimisation techniques and geographical information systems (GIS) to aid multi-organisational decision-making. An integrated decision system was created comprising a cartographic model implemented in GIS to discard floodable facilities, combined with two models focused on optimising the decisions regarding location of emergency facilities, stock prepositioning, the allocation of resources and relief distribution, along with the number of actors required to perform these activities. Three in-depth case studies in Mexico were studied gathering information from different organisations. The cartographic model proved to reduce the risk to select unsuitable facilities. The preparedness and response models showed the capacity to optimise the decisions and the number of organisations required for logistical activities, pointing towards an excess of actors involved in all cases. The system as a whole demonstrated its capacity to provide integrated support for disaster preparedness and response, along with the existence of room for improvement for Mexican organisations in flood management.

System design and resource management in the next-generation integrated WLAN and 3G cellular networks

Next-generation integrated wireless local area network (WLAN) and 3G cellular networks aim to take advantage of the roaming ability in a cellular network and the high data rate services of a WLAN. To ensure successful implementation of an integrated network, many issues must be carefully addressed, including network architecture design, resource management, quality-of-service (QoS), call admission control (CAC) and mobility management. ^ This dissertation focuses on QoS provisioning, CAC, and the network architecture design in the integration of WLANs and cellular networks. First, a new scheduling algorithm and a call admission control mechanism in IEEE 802.11 WLAN are presented to support multimedia services with QoS provisioning. The proposed scheduling algorithms make use of the idle system time to reduce the average packet loss of realtime (RT) services. The admission control mechanism provides long-term transmission quality for both RT and NRT services by ensuring the packet loss ratio for RT services and the throughput for non-real-time (NRT) services. ^ A joint CAC scheme is proposed to efficiently balance traffic load in the integrated environment. A channel searching and replacement algorithm (CSR) is developed to relieve traffic congestion in the cellular network by using idle channels in the WLAN. The CSR is optimized to minimize the system cost in terms of the blocking probability in the interworking environment. Specifically, it is proved that there exists an optimal admission probability for passive handoffs that minimizes the total system cost. Also, a method of searching the probability is designed based on linear-programming techniques. ^ Finally, a new integration architecture, Hybrid Coupling with Radio Access System (HCRAS), is proposed for lowering the average cost of intersystem communication (IC) and the vertical handoff latency. An analytical model is presented to evaluate the system performance of the HCRAS in terms of the intersystem communication cost function and the handoff cost function. Based on this model, an algorithm is designed to determine the optimal route for each intersystem communication. Additionally, a fast handoff algorithm is developed to reduce the vertical handoff latency.^

Algorithms for scheduling parallel batch processing machines with non-identical job ready times

This research is motivated by a practical application observed at a printed circuit board (PCB) manufacturing facility. After assembly, the PCBs (or jobs) are tested in environmental stress screening (ESS) chambers (or batch processing machines) to detect early failures. Several PCBs can be simultaneously tested as long as the total size of all the PCBs in the batch does not violate the chamber capacity. PCBs from different production lines arrive dynamically to a queue in front of a set of identical ESS chambers, where they are grouped into batches for testing. Each line delivers PCBs that vary in size and require different testing (or processing) times. Once a batch is formed, its processing time is the longest processing time among the PCBs in the batch, and its ready time is given by the PCB arriving last to the batch. ESS chambers are expensive and a bottleneck. Consequently, its makespan has to be minimized. ^ A mixed-integer formulation is proposed for the problem under study and compared to a formulation recently published. The proposed formulation is better in terms of the number of decision variables, linear constraints and run time. A procedure to compute the lower bound is proposed. For sparse problems (i.e. when job ready times are dispersed widely), the lower bounds are close to optimum. ^ The problem under study is NP-hard. Consequently, five heuristics, two metaheuristics (i.e. simulated annealing (SA) and greedy randomized adaptive search procedure (GRASP)), and a decomposition approach (i.e. column generation) are proposed—especially to solve problem instances which require prohibitively long run times when a commercial solver is used. Extensive experimental study was conducted to evaluate the different solution approaches based on the solution quality and run time. ^ The decomposition approach improved the lower bounds (or linear relaxation solution) of the mixed-integer formulation. At least one of the proposed heuristic outperforms the Modified Delay heuristic from the literature. For sparse problems, almost all the heuristics report a solution close to optimum. GRASP outperforms SA at a higher computational cost. The proposed approaches are viable to implement as the run time is very short. ^

Efficient asynchronous scheduling algorithms for cost-effective buffered crossbar switches

Buffered crossbar switches have recently attracted considerable attention as the next generation of high speed interconnects. They are a special type of crossbar switches with an exclusive buffer at each crosspoint of the crossbar. They demonstrate unique advantages over traditional unbuffered crossbar switches, such as high throughput, low latency, and asynchronous packet scheduling. However, since crosspoint buffers are expensive on-chip memories, it is desired that each crosspoint has only a small buffer. This dissertation proposes a series of practical algorithms and techniques for efficient packet scheduling for buffered crossbar switches. To reduce the hardware cost of such switches and make them scalable, we considered partially buffered crossbars, whose crosspoint buffers can be of an arbitrarily small size. Firstly, we introduced a hybrid scheme called Packet-mode Asynchronous Scheduling Algorithm (PASA) to schedule best effort traffic. PASA combines the features of both distributed and centralized scheduling algorithms and can directly handle variable length packets without Segmentation And Reassembly (SAR). We showed by theoretical analysis that it achieves 100% throughput for any admissible traffic in a crossbar with a speedup of two. Moreover, outputs in PASA have a large probability to avoid the more time-consuming centralized scheduling process, and thus make fast scheduling decisions. Secondly, we proposed the Fair Asynchronous Segment Scheduling (FASS) algorithm to handle guaranteed performance traffic with explicit flow rates. FASS reduces the crosspoint buffer size by dividing packets into shorter segments before transmission. It also provides tight constant performance guarantees by emulating the ideal Generalized Processor Sharing (GPS) model. Furthermore, FASS requires no speedup for the crossbar, lowering the hardware cost and improving the switch capacity. Thirdly, we presented a bandwidth allocation scheme called Queue Length Proportional (QLP) to apply FASS to best effort traffic. QLP dynamically obtains a feasible bandwidth allocation matrix based on the queue length information, and thus assists the crossbar switch to be more work-conserving. The feasibility and stability of QLP were proved, no matter whether the traffic distribution is uniform or non-uniform. Hence, based on bandwidth allocation of QLP, FASS can also achieve 100% throughput for best effort traffic in a crossbar without speedup.

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.^

Scheduling medical application workloads on virtualized computing systems

This dissertation presents and evaluates a methodology for scheduling medical application workloads in virtualized computing environments. Such environments are being widely adopted by providers of "cloud computing" services. In the context of provisioning resources for medical applications, such environments allow users to deploy applications on distributed computing resources while keeping their data secure. Furthermore, higher level services that further abstract the infrastructure-related issues can be built on top of such infrastructures. For example, a medical imaging service can allow medical professionals to process their data in the cloud, easing them from the burden of having to deploy and manage these resources themselves. In this work, we focus on issues related to scheduling scientific workloads on virtualized environments. We build upon the knowledge base of traditional parallel job scheduling to address the specific case of medical applications while harnessing the benefits afforded by virtualization technology. To this end, we provide the following contributions: (1) An in-depth analysis of the execution characteristics of the target applications when run in virtualized environments. (2) A performance prediction methodology applicable to the target environment. (3) A scheduling algorithm that harnesses application knowledge and virtualization-related benefits to provide strong scheduling performance and quality of service guarantees. In the process of addressing these pertinent issues for our target user base (i.e. medical professionals and researchers), we provide insight that benefits a large community of scientific application users in industry and academia. Our execution time prediction and scheduling methodologies are implemented and evaluated on a real system running popular scientific applications. We find that we are able to predict the execution time of a number of these applications with an average error of 15%. Our scheduling methodology, which is tested with medical image processing workloads, is compared to that of two baseline scheduling solutions and we find that it outperforms them in terms of both the number of jobs processed and resource utilization by 20–30%, without violating any deadlines. We conclude that our solution is a viable approach to supporting the computational needs of medical users, even if the cloud computing paradigm is not widely adopted in its current form.

A Human Resource Development Performance Improvement Model for Workers with Mental Retardation in Supported Employment

This literature review discusses the factors for successful job retention of adult workers with mental retardation, including external factors related to work environments and internal issues of the individual worker. Through the synthesis of the literature, a performance improvement model for supported employment is discussed based on Holton’s (1999) human resource development/performance improvement model.

Meating the social: sharing atiku-euiash in Sheshatshiu, Labrador

This work examines atiku-euiash (caribou meat) sharing practices in Sheshatshiu, Newfoundland and Labrador, and aims to elucidate an overarching question: how do sharing practices participate in the co-constitution of the Innu ‘social’? The ‘social’ is understood in this work as a descriptor that refers to the emergent properties of the Innu collective. The thesis is that sharing practices participate in the co-constitution of the Innu social and enact its boundaries. Inside these boundaries, atiku-euiash is more than simply a food resource: by realizing Innu values of generosity, respect and autonomy, sharing implicates the associations of human, animal, and animal masters that constitute the Innu world. Sharing is connected with the enskilment of the younger generations by their el-ders, and thus with the reproduction of Innu values through time. The ways of sharing are relevant because changes in such practices affect the constitution of the Innu social. Giv-en Euro-Canadian colonization, the Innu are in a fraught social space in which sharing is interrupted by colonization practices and values. Understanding sharing is necessary to develop policies that do not interrupt the reproduction of the Innu world This work uses several research methods: participant observation, sharing surveys, and interviews. It also uses network analysis as sharing practices leave traces of giving and receiving actions and these traces can be represented as a network of givers, receivers and circulating caribou meat. There are two main ways in which caribou is hunted and shared: household-based hunts and community-based hunts. The household-based hunts are organized by the hunters themselves, who are able and willing to hunt. Community-based hunts are completely organized and funded by the SIFN or the Innu Nation. In or-der to understand the differences in the distribution of the two hunt types, the categories of centrality and clustering are used to show how the flow of atiku-eiuash and its associ-ated realization of values and enskilment correlate with different degrees of centralization inside the sharing clusters.

Development of an education resource for families and clients navigating through end-of-life care with at-home palliation

Background: Community health nurses (CHNs) play a pivotal role in providing end-of-life care to clients diagnosed with a life-threatening illness. Providing quality end-of-life care is an ethical obligation. Eastern Health’s palliative end-of-life care program (PEOLC) offers nursing care, equipment, services, and support. However, the caregiver’s need for practical information about end-of-life issues is not addressed. Purpose: To develop an educational resource to assist clients and families during end-of-life and to provide a framework for new CHNs in home palliation. Methods: An informal Needs Assessment, a literature review, an environmental scan, and consultations with four CHNs involved with home palliation. Results: An educational resource was developed to address the practical end-of-life issues identified in the literature review and consultations. Conclusion: An improved delivery of care for at-home palliation in the community for clients and families, and a framework for new CHNs.

Socialization of Early Prosocial Behavior: Parents' Talk about Emotions is Associated with Sharing and Helping in Toddlers.

What role does socialization play in the origins of prosocial behavior? We examined one potential socialization mechanism, parents' discourse about others' emotions with very young children in whom prosocial behavior is still nascent. Two studies are reported, one of sharing in 18- and 24-month-olds (n = 29), and one of instrumental and empathy-based helping in 18- and 30-month-olds (n = 62). In both studies, parents read age-appropriate picture books to their children and the content and structure of their emotion-related and internal state discourse were coded. Results showed that children who helped and shared more quickly and more often, especially in tasks that required more complex emotion understanding, had parents who more often asked them to label and explain the emotions depicted in the books. Moreover, it was parents' elicitation of children's talk about emotions rather than parents' own production of emotion labels and explanations that explained children's prosocial behavior, even after controlling for age. Thus, it is the quality, not the quantity, of parents' talk about emotions with their toddlers that matters for early prosocial behavior.

PENTAZOCINE VERSUS PENTAZOCINE WITH RECTAL DICLOFENAC FOR POSTOPERATIVE PAIN RELIEF AFTER CESAREAN SECTION- A DOUBLE BLIND RANDOMIZED PLACEBO CONTROLLED TRIAL IN A LOW RESOURCE AREA.

BACKGROUND: The unimodal approach of using pentazocine as post-cesarean section pain relief is inadequate, hence the need for a safer, easily available and more effective multimodal approach. AIM: To evaluate the effectiveness of rectal diclofenac combined with intramuscular pentazocine for postoperative pain following cesarean section. METHODS: In this double blind clinical trial, 130 pregnant women scheduled for cesarean section under spinal anesthesia were randomly assigned to two groups. Group A received 100mg diclofenac suppository and group B received placebo suppository immediately following surgery, 12 and 24h later. Both groups also received intramuscular pentazocine 30mg immediately following surgery and 6 hourly postoperatively in the first 24 h. Postoperative pain was assessed by visual analogue scale at end of surgery and 2, 12 and 24 h after surgery. Patient satisfaction scores were also assessed. RESULTS: One hundred and sixteen patients completed the study. Combining diclofenac and pentazocine had statistically significant reduction in pain intensity at 2, 12, and 24 hours postoperatively compared to pentazocine alone (p <0.05). No significant side effects were noted in both groups. The combined group also had significantly better patient satisfaction scores. CONCLUSION: The addition of diclofenac suppository to intramuscular pentazocine provides better pain relief after cesarean section and increased patient satisfaction.

Secure Transmission in Spectrum Sharing MIMO Networks with Generalized Antenna Selection over Nakagami-m Channels

In this paper, we investigate the secrecy outage performance of spectrum sharing multiple-input multiple-output networks using generalized transmit antenna selection with maximal ratio combining over Nakagami-m channels. In particular, the outdated channel state information is considered at the process of antenna selection due to feedback delay. Considering a practical passive eavesdropper scenario, we derive the exact and asymptotic closed-form expressions of secrecy outage probability, which enable us to evaluate the secrecy performance with high efficiency and present a new design insight into the impact of key parameters on the secrecy performance. In addition, the analytical results demonstrate that the achievable secrecy diversity order is only determined by the parameters of the secondary network, while other parameters related to primary or eavesdropper’s channels have a significantly impact on the secrecy coding gain.