The Relationship between TQM Practices and Quality Performance and the Role of Formal TQM Programs: An Australian Empirical Study

This article presents the findings from an empirical study examining the relationship between total quality management (TQM) practices and quality performance in Australian organizations. A comparison is made between organizations that have adopted formal TQM programs and organizations without a formal program in place. It was recognized that the lack of a formal program did not necessarily mean TQM principles were not being practiced. The findings show that the firms adopting formal TQM programs implement several TQM practices at a higher level than those that do not have TQM programs. This difference, however, is not apparent in the case of quality performance. Furthermore, the findings show the strong links between TQM practices and quality performance, and there is no significant difference between organizations implementing formal TQM programs and those organizations simply adopting TQM practices. This suggests that it is the adoption of quality practices that matters rather than formal programs per se.

Mentoring

For many years mentoring has been a well-recognised learning strategy for workers in a variety of settings such as schools, hospitals, universities and other types of organisations. It has been used to induct, socialise, train and support the knowledge and skill development of novices in all types of professions, including novice leaders. Some organisations have formalised the mentoring process by introducing mentoring programs that are integral to their human resource management strategies. Other organisations employ mentoring programs to address affirmative action requirements thus providing mentoring opportunities to members of particular target groups as a means of developing their competencies and assisting their career progression. Because of the diversity of ways in which mentoring has been used in organisations it has taken different forms and been experienced by mentors and mentees in different ways. The aim of this chapter is to provide some clarity about the term ‘mentoring’ and its practice within organisations. It begins with an exploration of the meaning and purposes of mentoring before reviewing some of the benefits and drawbacks the process provides for mentors, persons who are mentored (i.e. mentees) and for the organisation as a whole. The chapter also considers a number of issues that are important for program planners, as well as issues that mentors and mentees should understand if they are going to make the most out of their mentoring relationship.

The purpose and place of mentoring for women managers in organisations: An Australian perspective

Mentoring has been identified as an important career development activity for women managers. Over the last four decades, organisations world-wide have implemented formal mentoring programs for women and for members of minority groups in recognition of the personal and professional benefits mentoring provides, not only for persons who are mentored but also, for those who undertake the mentoring. This chapter reviews the literature on mentoring and the contribution it can make to the career development of women managers. It reviews several inter-related bodies of literature: women’s representation in management positions worldwide; theories and frameworks of mentoring; empirical research exploring the impact of mentoring relationships on women managers’ career development; current illustrations of formal programs offered to women managers in the public and private sectors; and some critical issues that continue to impact women managers in relation to mentoring relationships. The chapter concludes by making an argument for further research on gender and mentoring.

Predictors of Weight Loss Maintenance following an Insurance-Sponsored Weight Management Program

Intentional weight loss among overweight and obese adults (body mass index ≥ 25 kg/m2) is associated with numerous health benefits, but weight loss maintenance (WLM) following participation in weight management programming has proven to be elusive. Many individuals attempting to lose weight join formal programs, especially women, but these programs vary widely in focus, as do postprogram weight regain results. We surveyed 2,106 former participants in a community-based, insurance-sponsored weight management program in the United States to identify the pre, during, and post-intervention behavioral and psychosocial factors that lead to successful WLM. Of 835 survey respondents (39.6% response rate), 450 met criteria for inclusion in this study. Logistic regression analyses suggest that interventionists should assess and discuss weight loss and behavior change perceptions early in a program. However, in developing maintenance plans later in a program, attention should shift to behaviors, such as weekly weighing, limiting snacking in the evening, limiting portion sizes, and being physically active every day.

Principals as architects of formal mentoring programs in schools

An important responsibility of principals in schools is fostering a healthy learning-rich environment for both staff and students. Previous research (Duignan & Gurr, 2008; Ehrich, 1998; Leithwood & Day, 2007; Nias, Southworth, & Campbell, 1992) has shown that effective principals create opportunities for teachers to learn with and from each other. For instance, they are involved in establishing supportive structures and creating environments for collaboration and learning to take place (Leithwood & Day, 2007). They do this in a variety of ways such as providing resources and professional development opportunities, structuring time for staff to learn and work together, and establishing a host of other conditions to facilitate learning and sharing.

When sparks fly : developing formal mentoring programs for the career development of young and emerging artists

Formal mentoring programs are accepted as a valuable strategy for developing young and emerging artists. This thesis presents the results of an evaluation of the SPARK National Young Artists Mentoring Program (SPARK). SPARK was a ten-month formal mentoring program managed by Youth Arts Queensland (YAQ) on behalf of the Australia Council for the Arts from 2003-2009. The program aimed to assist young and emerging Australian artists between the ages of 18-26 to establish a professional career in the arts. It was a highly successful formal arts mentoring program that facilitated 58 mentorships between young and emerging artists and professional artists from across Australia in five program rounds over its seven year lifespan. Interest from other cultural organisations looking to develop their own formal mentoring programs encouraged YAQ to commission this research to determine how the program works to achieve its effects. This study was conducted with young and emerging artists who participated in SPARK from 2003 to 2008. It took a theory-driven evaluation approach to examine SPARK as an example of what makes formal arts mentoring programs effective. It focused on understanding the program’s theory or how the program worked to achieve its desired outcomes. The program activities and assumed responses to program activities were mapped out in a theories of change model. This theoretical framework was then used to plan the points for data collection. Through the process of data collection, actual program developments were compared to the theoretical framework to see what occurred as expected and what did not. The findings were then generalised for knowledge and wider application. The findings demonstrated that SPARK was a successful and effective program and an exemplar model of a formal mentoring program preparing young and emerging artists for professional careers in the arts. They also indicate several ways in which this already strong program could be further improved, including: looking at the way mentoring relationships are set up and how the mentoring process is managed; considering the balance between artistic and professional development; developing career development competencies and networking skills; taking into account the needs of young and emerging artists to develop their professional identity and build confidence; and giving more thought to the desired program outcomes and considering the issue of timeliness and readiness for career transition. From these findings, together with principles outlined in the mentoring and career development literature, a number of necessary conditions have been identified for developing effective mentoring programs in the career development of young and emerging artists.

Formal Analysis of MPI-based Parallel Programs

Most parallel computing applications in highperformance computing use the Message Passing Interface (MPI) API. Given the fundamental importance of parallel computing to science and engineering research, application correctness is paramount. MPI was originally developed around 1993 by the MPI Forum, a group of vendors, parallel programming researchers, and computational scientists. However, the document defining the standard is not issued by an official standards organization but has become a de facto standard © 2011 ACM.

Micro finance programs: caring for those missed by formal social protection mechanism

In line with the current global trend of economic and social restructuring, it has become essential to address the issue of poverty and social protection for the poorer segment of the population who are not covered by formal social protection mechanisms. Micro finance institutions (MFIs) in developing countries have been working towards poverty alleviation and enhancing social protection for the last few decades. MFI’s provision of financial assistance to the poor has been instrumental in improving the overall quality of the impoverished. Based on an in-depth qualitative study conducted across three different types of NGOs (Non Governmental Organization) in the Philippines, this study found a relationship between micro finance programs and improved social protection. The study reveals that MFIs have the ability to make a positive impact on areas such as entrepreneurship, education, housing, job security and income generation.

Formal verification of PLC programs using the B Method

PLCs (acronym for Programmable Logic Controllers) perform control operations, receiving information from the environment, processing it and modifying this same environment according to the results produced. They are commonly used in industry in several applications, from mass transport to petroleum industry. As the complexity of these applications increase, and as various are safety critical, a necessity for ensuring that they are reliable arouses. Testing and simulation are the de-facto methods used in the industry to do so, but they can leave flaws undiscovered. Formal methods can provide more confidence in an application s safety, once they permit their mathematical verification. We make use of the B Method, which has been successfully applied in the formal verification of industrial systems, is supported by several tools and can handle decomposition, refinement, and verification of correctness according to the specification. The method we developed and present in this work automatically generates B models from PLC programs and verify them in terms of safety constraints, manually derived from the system requirements. The scope of our method is the PLC programming languages presented in the IEC 61131-3 standard, although we are also able to verify programs not fully compliant with the standard. Our approach aims to ease the integration of formal methods in the industry through the abbreviation of the effort to perform formal verification in PLCs

Formal Verification of Temporal Properties for Parametrized Concurrent Programs and Concurrent Data Structures

Los tipos de datos concurrentes son implementaciones concurrentes de las abstracciones de datos clásicas, con la diferencia de que han sido específicamente diseñados para aprovechar el gran paralelismo disponible en las modernas arquitecturas multiprocesador y multinúcleo. La correcta manipulación de los tipos de datos concurrentes resulta esencial para demostrar la completa corrección de los sistemas de software que los utilizan. Una de las mayores dificultades a la hora de diseñar y verificar tipos de datos concurrentes surge de la necesidad de tener que razonar acerca de un número arbitrario de procesos que invocan estos tipos de datos de manera concurrente. Esto requiere considerar sistemas parametrizados. En este trabajo estudiamos la verificación formal de propiedades temporales de sistemas concurrentes parametrizados, poniendo especial énfasis en programas que manipulan estructuras de datos concurrentes. La principal dificultad a la hora de razonar acerca de sistemas concurrentes parametrizados proviene de la interacción entre el gran nivel de concurrencia que éstos poseen y la necesidad de razonar al mismo tiempo acerca de la memoria dinámica. La verificación de sistemas parametrizados resulta en sí un problema desafiante debido a que requiere razonar acerca de estructuras de datos complejas que son accedidas y modificadas por un numero ilimitado de procesos que manipulan de manera simultánea el contenido de la memoria dinámica empleando métodos de sincronización poco estructurados. En este trabajo, presentamos un marco formal basado en métodos deductivos capaz de ocuparse de la verificación de propiedades de safety y liveness de sistemas concurrentes parametrizados que manejan estructuras de datos complejas. Nuestro marco formal incluye reglas de prueba y técnicas especialmente adaptadas para sistemas parametrizados, las cuales trabajan en colaboración con procedimientos de decisión especialmente diseñados para analizar complejas estructuras de datos concurrentes. Un aspecto novedoso de nuestro marco formal es que efectúa una clara diferenciación entre el análisis del flujo de control del programa y el análisis de los datos que se manejan. El flujo de control del programa se analiza utilizando reglas de prueba y técnicas de verificación deductivas especialmente diseñadas para lidiar con sistemas parametrizados. Comenzando a partir de un programa concurrente y la especificación de una propiedad temporal, nuestras técnicas deductivas son capaces de generar un conjunto finito de condiciones de verificación cuya validez implican la satisfacción de dicha especificación temporal por parte de cualquier sistema, sin importar el número de procesos que formen parte del sistema. Las condiciones de verificación generadas se corresponden con los datos manipulados. Estudiamos el diseño de procedimientos de decisión especializados capaces de lidiar con estas condiciones de verificación de manera completamente automática. Investigamos teorías decidibles capaces de describir propiedades de tipos de datos complejos que manipulan punteros, tales como implementaciones imperativas de pilas, colas, listas y skiplists. Para cada una de estas teorías presentamos un procedimiento de decisión y una implementación práctica construida sobre SMT solvers. Estos procedimientos de decisión son finalmente utilizados para verificar de manera automática las condiciones de verificación generadas por nuestras técnicas de verificación parametrizada. Para concluir, demostramos como utilizando nuestro marco formal es posible probar no solo propiedades de safety sino además de liveness en algunas versiones de protocolos de exclusión mutua y programas que manipulan estructuras de datos concurrentes. El enfoque que presentamos en este trabajo resulta ser muy general y puede ser aplicado para verificar un amplio rango de tipos de datos concurrentes similares. Abstract Concurrent data types are concurrent implementations of classical data abstractions, specifically designed to exploit the great deal of parallelism available in modern multiprocessor and multi-core architectures. The correct manipulation of concurrent data types is essential for the overall correctness of the software system built using them. A major difficulty in designing and verifying concurrent data types arises by the need to reason about any number of threads invoking the data type simultaneously, which requires considering parametrized systems. In this work we study the formal verification of temporal properties of parametrized concurrent systems, with a special focus on programs that manipulate concurrent data structures. The main difficulty to reason about concurrent parametrized systems comes from the combination of their inherently high concurrency and the manipulation of dynamic memory. This parametrized verification problem is very challenging, because it requires to reason about complex concurrent data structures being accessed and modified by threads which simultaneously manipulate the heap using unstructured synchronization methods. In this work, we present a formal framework based on deductive methods which is capable of dealing with the verification of safety and liveness properties of concurrent parametrized systems that manipulate complex data structures. Our framework includes special proof rules and techniques adapted for parametrized systems which work in collaboration with specialized decision procedures for complex data structures. A novel aspect of our framework is that it cleanly differentiates the analysis of the program control flow from the analysis of the data being manipulated. The program control flow is analyzed using deductive proof rules and verification techniques specifically designed for coping with parametrized systems. Starting from a concurrent program and a temporal specification, our techniques generate a finite collection of verification conditions whose validity entails the satisfaction of the temporal specification by any client system, in spite of the number of threads. The verification conditions correspond to the data manipulation. We study the design of specialized decision procedures to deal with these verification conditions fully automatically. We investigate decidable theories capable of describing rich properties of complex pointer based data types such as stacks, queues, lists and skiplists. For each of these theories we present a decision procedure, and its practical implementation on top of existing SMT solvers. These decision procedures are ultimately used for automatically verifying the verification conditions generated by our specialized parametrized verification techniques. Finally, we show how using our framework it is possible to prove not only safety but also liveness properties of concurrent versions of some mutual exclusion protocols and programs that manipulate concurrent data structures. The approach we present in this work is very general, and can be applied to verify a wide range of similar concurrent data types.

Mind change complexity of learning logic programs

The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds for learnability of these classes both from positive facts and from positive and negative facts. Building on Angluin’s notion of finite thickness and Wright’s work on finite elasticity, Shinohara defined the property of bounded finite thickness to give a sufficient condition for learnability of indexed families of computable languages from positive data. This paper shows that an effective version of Shinohara’s notion of bounded finite thickness gives sufficient conditions for learnability with ordinal mind change bound, both in the context of learnability from positive data and for learnability from complete (both positive and negative) data. Let Omega be a notation for the first limit ordinal. Then, it is shown that if a language defining framework yields a uniformly decidable family of languages and has effective bounded finite thickness, then for each natural number m >0, the class of languages defined by formal systems of length <= m: • is identifiable in the limit from positive data with a mind change bound of Omega (power)m; • is identifiable in the limit from both positive and negative data with an ordinal mind change bound of Omega × m. The above sufficient conditions are employed to give an ordinal mind change bound for learnability of minimal models of various classes of length-bounded Prolog programs, including Shapiro’s linear programs, Arimura and Shinohara’s depth-bounded linearly covering programs, and Krishna Rao’s depth-bounded linearly moded programs. It is also noted that the bound for learning from positive data is tight for the example classes considered.

Resourcing resilience through recreational music programs

Many music programs in Australia deliver a United States (US) package created by the Recreational Music-Making Movement, founded by Karl Bruhn and Barry Bittman. This quasi-formal group of music makers, academics and practitioners uses the logic of decentralised global networks to connect with local musicians, offering them benefits associated with their ‘Recreational Music Program’ (RMP). These RMPs encapsulate the broad goals of the movement, developed in the US during the 1980s, and now available as a package, endorsed by the National Association of Music Merchants (NAMM), for music retailers and community organisations to deliver locally (Bittman et al., 2003). High participation rates in RMPs have been historically documented amongst baby boomers with disposable income. Yet the Australian programs increasingly target marginalised groups and associated funding sources, which in turn has lowered the costs of participation. This chapter documents how Australian manifestations of RMPs presently report on the benefits of participation to attract cross-sector funding. It seeks to show the diversity of participants who claim to have developed and accessed resources that improve their capacity for resilience through recreational music performance events. We identify funding issues pertaining to partnerships between local agencies and state governments that have begun to commission such music programs. Our assessment of eight Australian RMPs includes all additional music groups implemented since the first program, their purposes and costs, the skills and coping strategies that participants developed, how organisers have reported on resources, outcomes and attracted funding. We represent these features through a summary table, standard descriptive statistics and commentaries from participants and organisers.

Stepwise refinement of interrupt-driven real-time programs

Embedded real-time programs rely on external interrupts to respond to events in their physical environment in a timely fashion. Formal program verification theories, such as the refinement calculus, are intended for development of sequential, block-structured code and do not allow for asynchronous control constructs such as interrupt service routines. In this article we extend the refinement calculus to support formal development of interrupt-dependent programs. To do this we: use a timed semantics, to support reasoning about the occurrence of interrupts within bounded time intervals; introduce a restricted form of concurrency, to model composition of interrupt service routines with the main program they may preempt; introduce a semantics for shared variables, to model contention for variables accessed by both interrupt service routines and the main program; and use real-time scheduling theory to discharge timing requirements on interruptible program code.

Information literacy programs and research: reflections on 'Information literacy programs and research: An international review' by Christine Bruce. 2000. The Australian Library Journal 49, 3: 209-218

Although in the late 1990s there was much discussion as to whether the idea of information literacy was necessary or had longevity, global interest in the phenomenon has increased rather than diminished. In the midst of all this activity, what has happened to the way in which we interpret the idea of information literacy in the last decade or more? The label of information literacy has certainly become widely applied, especially to library based programs and remains more popular in formal learning environments.Ultimately information literacy is about peoples’ experience of using information wherever they happen to be. Information literacy is about people interacting, engaging, working with information in many contexts, either individually or in community. Emerging technologies may transform the kinds of information available and how it is engaged with. Nevertheless, we continue to need to understand the experience of information use in order to support people in their information environments. We continue to need to develop programs which reflect and enhance peoples’ experiences of using information to learn in ever widening and more complex settings (Bruce, 2008; Bruce & Hughes, 2010).

Petri net based performance modeling for effective DVFS for multithreaded programs

Dynamic Voltage and Frequency Scaling (DVFS) is a very effective tool for designing trade-offs between energy and performance. In this paper, we use a formal Petri net based program performance model that directly captures both the application and system properties, to find energy efficient DVFS settings for CMP systems, that satisfy a given performance constraint, for SPMD multithreaded programs. Experimental evaluation shows that we achieve significant energy savings, while meeting the performance constraints.