An efficient and optimized bluetooth scheduling algorithm for piconets

Bluetooth is an emerging standard in short range, low cost and low power wireless networks. MAC is a generic polling based protocol, where a central Bluetooth unit (master) determines channel access to all other nodes (slaves) in the network (piconet). An important problem in Bluetooth is the design of efficient scheduling protocols. This paper proposes a polling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in a Bluetooth Piconet. We present an extensive set of simulation results and performance comparisons with two important existing algorithms. Our results indicate that our proposed scheduling algorithm outperforms the Round Robin scheduling algorithm by more than 40% in all cases tried. Our study also confirms that our proposed policy achieves higher throughput and lower packet delays with reasonable fairness among all the connections.

Cost-efficient virtual machine management in data centers

Virtual Machine (VM) management is an obvious need in today's data centers for various management activities and is accomplished in two phases— finding an optimal VM placement plan and implementing that placement through live VM migrations. These phases result in two research problems— VM placement problem (VMPP) and VM migration scheduling problem (VMMSP). This research proposes and develops several evolutionary algorithms and heuristic algorithms to address the VMPP and VMMSP. Experimental results show the effectiveness and scalability of the proposed algorithms. Finally, a VM management framework has been proposed and developed to automate the VM management activity in cost-efficient way.

Complexity of scheduling for minimum power on a GMAC

Two decision versions of a combinatorial power minimization problem for scheduling in a time-slotted Gaussian multiple-access channel (GMAC) are studied in this paper. If the number of slots per second is a variable, the problem is shown to be NP-complete. If the number of time-slots per second is fixed, an algorithm that terminates in O (Length (I)N+1) steps is provided.

Data-aware task scheduling for all-to-all comparison problems in heterogeneous distributed systems

Solving large-scale all-to-all comparison problems using distributed computing is increasingly significant for various applications. Previous efforts to implement distributed all-to-all comparison frameworks have treated the two phases of data distribution and comparison task scheduling separately. This leads to high storage demands as well as poor data locality for the comparison tasks, thus creating a need to redistribute the data at runtime. Furthermore, most previous methods have been developed for homogeneous computing environments, so their overall performance is degraded even further when they are used in heterogeneous distributed systems. To tackle these challenges, this paper presents a data-aware task scheduling approach for solving all-to-all comparison problems in heterogeneous distributed systems. The approach formulates the requirements for data distribution and comparison task scheduling simultaneously as a constrained optimization problem. Then, metaheuristic data pre-scheduling and dynamic task scheduling strategies are developed along with an algorithmic implementation to solve the problem. The approach provides perfect data locality for all comparison tasks, avoiding rearrangement of data at runtime. It achieves load balancing among heterogeneous computing nodes, thus enhancing the overall computation time. It also reduces data storage requirements across the network. The effectiveness of the approach is demonstrated through experimental studies.

Efficient scheduling of sensor activity for information coverage in wireless sensor networks

In this paper, we are concerned with algorithms for scheduling the sensing activity of sensor nodes that are deployed to sense/measure point-targets in wireless sensor networks using information coverage. Defining a set of sensors which collectively can sense a target accurately as an information cover, we propose an algorithm to obtain Disjoint Set of Information Covers (DSIC), which achieves longer network life compared to the set of covers obtained using an Exhaustive-Greedy-Equalized Heuristic (EGEH) algorithm proposed recently in the literature. We also present a detailed complexity comparison between the DSIC and EGEH algorithms.

Book Review: "The Interface: IBM and the Transformation of Corporate Design, 1945-1975", John Harwood, Minneapolis: University of Minnesota Press, 2011

Within the history of twentieth-century design, there are a number of well-known objects and stories that are invoked time and time again to capture a pivotal moment or summarize a much broader historical transition. For example, Marcel Breuer’s Model B3 chair is frequently used as a stand-in for the radical investigations of form and new industrial materials occurring at the Bauhaus in the mid-1920s. Similarly, Raymond Loewy’s streamlined pencil sharpener has become historical shorthand for the emergence of modern industrial design in the 1930s. And any discussion of the development of American postwar “organic design” seems incomplete without reference to Charles and Ray Eames’s molded plywood leg splint of 1942. Such objects and narratives are dear to historians of modern design. They are tangible, photogenic subjects that slot nicely into exhibitions, historical surveys, and coffee-table best sellers...

Optimal sleep-wake scheduling for quickest intrusion detection using sensor networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices, we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: (1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, (2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which (3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time), based on the sensor observations obtained until time slot k. Our results show that an optimum closed loop control on Mk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.

Highlight: Yale University Art Gallery

Modern architecture, with its exposed concrete, glass, and steel expanses, does not age gracefully. The Yale University Art Gallery, designed by architecture great Louis Kahn, is no exception. As Yale's first modernist building, completed in 1953, and Kahn's first major commission and collaboration with pioneering lighting designer, Richard Kelly, the gallery is an important part of American architecture. Yet, despite its iconic status, the building suffered numerous architectural indignities in the years following its completion, including the insertion of permanent gallery partitions, which divided Kahn's open plan, and the enclosure of an exterior court, which blocked daylight to the lower galleries.

Student facilitated PBL - A capstone collaborative learning experience in the Griffith University MBBS program

We report on an innovation in teaching and learning designed to extend the collaborative learning of PBL, that occurs during the first two years of a four year graduate entry medical program, to a capstone learning experience to assist the transition to a hospital based year 3. During the last five weeks of Year 2 the PBL sessions consist of an initial student facilitated session early in the week followed by a large format session for the entire class convened by two clinicians. The new format PBL was perceived positively by the students and staff involved and may have advantages over traditional formats in developing students' clinical reasoning and differential diagnosis skills.

Problem-based learning in an e-learning environment: A case study at Griffith University School of Medicine

Increasing numbers of medical schools in Australia and overseas have moved away from didactic teaching methodologies and embraced problem-based learning (PBL) to improve clinical reasoning skills and communication skills as well as to encourage self-directed lifelong learning. In January 2005, the first cohort of students entered the new MBBS program at the Griffith University School of Medicine, Gold Coast, to embark upon an exciting, fully integrated curriculum using PBL, combining electronic delivery, communication and evaluation systems incorporating cognitive principles that underpin the PBL process. This chapter examines the educational philosophies and design of the e-learning environment underpinning the processes developed to deliver, monitor and evaluate the curriculum. Key initiatives taken to promote student engagement and innovative and distinctive approaches to student learning at Griffith promoted within the conceptual model for the curriculum are (a) Student engagement, (b) Pastoral care, (c) Staff engagement, (d) Monitoring and (e) Curriculum/Program Review. © 2007 Springer-Verlag Berlin Heidelberg.

Enhancing the learning experiences through Industry-Based Learning from Indonesian university perspective

This paper investigates how students’ learning experience can be enhanced by participating in the Industry-Based Learning (IBL) program. In this program, the university students coming into the industry to experience how the business is run. The students’ learning media is now not coming from the textbooks or the lecturers but from learning by doing. This new learning experience could be very interesting for students but at the same time could also be challenging. The research involves interviewing a number of students from the IBL programs, the academic staff from the participated university who has experience in supervising students and the employees of the industry who supported and supervised the students in their work placements. The research findings offer useful insights and create new knowledge in the field of education and learning. The research contributes to the existing knowledge by providing a new understanding of the topic as it applied to the Indonesian context.

Realisation of University-Industry Collaboration through Industry-Based Learning at Indonesian Higher Education

The collaboration between universities and industries has become increasingly important for the development of Science and Technology. This is particularly more prominent in the Science Technology Engineering and Mathematics (STEM) disciplines. Literature suggest that the key element of University-Industry Partnership (UIP) is the exchange of knowledge that is mutually beneficial for both parties. One real example of the collaborations is Industry-Based Learning (IBL) in which university students are coming into industries to experience and learn how the skills and knowledge acquired in the classroom are implemented in work places. This paper investigate how the University-Industry Collaboration program is implemented though Industry-Based Learning (IBL) at Indonesian Universities. The research findings offer useful insights and create a new knowledge in the field of STEM education and collaborative learning. The research will contribute to existing knowledge by providing empirical understanding of this topic. The outcomes can be used to improve the quality of University-Industry Partnership programs at Indonesian Universities and inform Indonesian higher education authorities and their industrial partners of an alternative approach to enhance their IBL programs.

Experiences in becoming a paramedic: The professional socialization of university qualified paramedics

In this article, the professional socialization of university educated paramedics from the United Kingdom and Australia is discussed using the anticipatory, formal and post-formal phases of socialization. Participants for this research were from universities and ambulance services in Australia and the United Kingdom, and the data were collected and analyzed by qualitative methods. The anticipatory, formal and post-formal phases were deemed to be relevant to the professional socialization of university paramedics. However a fourth phase, called the post-internship phase was identified which better accounted for the paramedic training and practice model. The findings from this research led to the development of a four phase model of professional socialization to describe the experiences of university educated paramedics making the transition from university students to qualified paramedics.