Productivity and efficiency analysis of Australia banking sector under deregulation

This paper conducts productivity and efficiency analysis of banks operating in Australia since the deregulation of the Australian financial system in early 1980s. Applying data envelopment analysis (DEA), with a moving window, the Malmquist indices are determined in order to investigate the levels of and the changes in the efficiency of Australian banks over the period from 1983 to 200 I. The DEA window analysis is adopted in order to relieve the small sample problem that in previous studies has proved problematic in the study of the Australian banking sector. The pal1icular window used in this case has been carefully designed to ensure the robustness of the efficiencies scores to changes in the window width. A second-stage regression is conducted by using the unconditional bootstrap approach suggested by Xue and Harker (1999) to overcome the dependency and heteroskedasticity of DE A efficiency scores. The empirical results demonstrate the effect of deregulation on the performance of individual banks, banks of different organizational types and the entire Australian banking sector.

Industrial relations and catholic social doctrine

This paper reviews the key principles of Catholic Social thought as they pertain to relations between labour and capital. It is argued that such principles are foundational for the conduct of ethical relations and the exercise of moral values in the workplace, and are recognisable in the right of workers to employment and just compensation for their labours, in the duty of employers to provide safe and engaging work for those in their charge, and in the obligation of the state to dispense wise governance in a manner that guarantees the welfare and security of all its citizens. It is argued that these principles have had de facto airing in Australian political and economic history, and that they might be usefully drawn upon again to protect the rights of workers under the current ascendency of neo-liberal policy solutions.

Finding rule groups to classify high dimensional gene expression datasets

Microarray data provides quantitative information about the transcription profile of cells. To analyze microarray datasets, methodology of machine learning has increasingly attracted bioinformatics researchers. Some approaches of machine learning are widely used to classify and mine biological datasets. However, many gene expression datasets are extremely high dimensionality, traditional machine learning methods can not be applied effectively and efficiently. This paper proposes a robust algorithm to find out rule groups to classify gene expression datasets. Unlike the most classification algorithms, which select dimensions (genes) heuristically to form rules groups to identify classes such as cancerous and normal tissues, our algorithm guarantees finding out best-k dimensions (genes), which are most discriminative to classify samples in different classes, to form rule groups for the classification of expression datasets. Our experiments show that the rule groups obtained by our algorithm have higher accuracy than that of other classification approaches

Power control in CDMA systems based on channel identification

Power control design is a critical aspect of CDMA cellular systems design. This paper develops an adaptive power controller design method for CDMA systems. The key to the power control design is on the recursive identification of the underlying wireless stochastic channel model parameters. The identification process guarantees the power controller to work well for systems in unknown or time varying network environment.

Adaptive fast finite time control of a class of uncertain nonlinear systems

This paper concerns the adaptive fast finite time control of a class of nonlinear uncertain systems of which the upper bounds of the system uncertainties are unknown. By using the fast non-smooth control Lyapunov function and the method of so-called adding a power integrator merging with adaptive technique, a recursive design procedure is provided, which guarantees the fast finite time stability of the closed-loop system. It is proved that the control input is bounded, and a simulation example is given to illustrate the effectiveness of the theoretical results.

Internationalization and alliance formation : evidence from Turkish SMEs

This study explores the issue of internationalization through forming alliances with foreign capital in the small business sector in Turkey. Using a sample of 257 SMEs from this emerging market economy, collected via a field study, it finds that Turkish SMEs would like to form alliances with foreign capital for expanding their production capacity and accessing to world markets. Multivariate multinomial logit models are employed to analyse the survey data econometrically. Size-specific, sector-specific and management-specific factors are identified in the alliance motivation. The `market' and `finance' aspects of alliances prevail in the multivariate analysis with significant implications. There is also evidence that some conditional relationships offered by multivariate analysis differ from unconditional associations found in the survey, which implies that alliance motivation is partly a product of multidimensional decision-making process on behalf of SMEs.

The influence of failure severity and perceived employee effort on consumers' postcomplaint negative WOM intentions in a service guarantee context

This study employed a 2 x 2 full-factorial, between-subjects design experiment examining the influence of failure severity and perceived employee effort on hotel guests’ negative word-ofmouth (WOM) intentions following invocation of a service guarantee. The study involved a sample of 131 online panel members. Results suggest that negative WOM intentions reduced when a greater level of effort is exerted by staff in rectifying the guest’s problem and increased when a more severe failure is experienced. There is a stronger difference in guests’ negative WOM intentions between the high and low employee effort conditions when a minor versus a severe service failure is experienced by guests.

Intersection of autonomy and social control : negotiating teenage motherhood

Contrary to popular belief, teenage mothers are a declining proportion of birthing women; however they receive much negative public attention. Of particular public concern is the high cost of supporting teenage mothers, in terms of financial, health and welfare resources. Historically, the typical founding mother of white Australia was single, but post-war changes in the family structure incorporated the expectation that children be born into two-parent households with the male as the breadwinner. Policy changes in the seventies saw the introduction of the Sole Parents Pension which meant that many birthing teenage women could choose to keep their infants rather than have a clandestine adoption or an enforced marriage. The parenting practices of teenage mothers have been criticised for being less than optimal, and mother and child are reported as being disadvantaged cognitively, psychosocially, and educationally. One widespread nursing service which provides support for new mothers in Victoria is the Maternal and Child Health Service; however, teenage mothers appear reluctant to use such services. Why this should be so became an important question for this research, since little is known about the parenting practices of teenage mothers. This study therefore sought to explore mothering from the perspective of five sole supporting teenage mothers each of whom had a child over six months of age. The research methodology took an interpretive ethnographic approach and was guided by feminist principles. The data were collected through repeated interviewing, participant observation, informal discussions with key informants, field notes and journalling. Data analysis was aided by the use of the software, program NUD-IST. It was found that the young women in this study each chose to give birth with full realisation that their existence was dependent on the Welfare State. Unanticipated, however, were the many structural barriers which made their lives cataclysmic, but these reinforced their determination to prove themselves worthy and capable mothers. The young women negotiated motherhood through a range of social supports and through maternal practice. Unquestionably, their social dependency on the welfare system forced them into marginal citizen status. Moreover, absolute and intrinsic poverty levels were experienced, brought about by inadequate welfare payments. Formal support agencies, such as the Maternal and Child Health nurses were rarely approached to provide childrearing support beyond the initial months following birthing, since the teenagers' basic needs such as shelter, food and clothing took precedence over their parenting needs. Additionally, some nurses were perceived to hold judgmental attitudes towards teenage mothers. It was far easier to forestall confrontation with nurses and the other 'older' women clientele by avoiding them. Thus XI they turned to charitable agencies who provided a safety net in the form of emergency supplies of money, food, or equipment. Informal networks of friends provided alternative modes of support when family help failed to materialise. The children, however, provided the young women with an opportunity to transform their lives by breaking free of the past, and by creating a new, mature existence for themselves. Despite being abandoned by family, friends, lovers and society, in the privacy and isolation of their own homes, they attempted to provide a more nurturing environment for their children than they themselves had received. Each bestowed unconditional maternal love on the child and were rewarded through the pleasures of watching their children grow and develop into worthwhile individuals. The children became the focus of their attention and their reason for living. In the course of their welfare dependency, the young women became public property, targets of surveillance, and were subjected to stigmatising and condescending public attitudes wherever they went. In this way, it was evident that they were an oppressed group, but each found ways of resisting. Rather than focussing on their oppressive or disabling lives, or dwelling on their disadvantaged status, the young women sought their identities as mature women through motherhood and by demonstrating that they could do this important job well. Through motherhood their lives had meaning and a sense of purpose. The thesis concludes that motherhood in the teenage years is difficult. However, if appropriate supports are made available, teenage mothers need be no different from non-teenage mothers. But with state resources shrinking, and their own resources limited, teenage mothers are disadvantaged. In some ways, this study showed that all levels of support were inadequate, although those provided through the charitable organizations were seen to be the most appropriate. This reflects the current policy of economic rationalism adopted by most Western liberal democracies in the 1980s and 1990s and no less by the former Keating Labor Government in Australia.

Programmer friendly and efficient distributed shared memory integrated into a distributed operating system

Distributed Shared Memory (DSM) provides programmers with a shared memory environment in systems where memory is not physically shared. Clusters of Workstations (COWs), an often untapped source of computing power, are characterised by a very low cost/performance ratio. The combination of Clusters of Workstations (COWs) with DSM provides an environment in which the programmer can use the well known approaches and methods of programming for physically shared memory systems and parallel processing can be carried out to make full use of the computing power and cost advantages of the COW. The aim of this research is to synthesise and develop a distributed shared memory system as an integral part of an operating system in order to provide application programmers with a convenient environment in which the development and execution of parallel applications can be done easily and efficiently, and which does this in a transparent manner. Furthermore, in order to satisfy our challenging design requirements we want to demonstrate that the operating system into which the DSM system is integrated should be a distributed operating system. In this thesis a study into the synthesis of a DSM system within a microkernel and client-server based distributed operating system which uses both strict and weak consistency models, with a write-invalidate and write-update based approach for consistency maintenance is reported. Furthermore a unique automatic initialisation system which allows the programmer to start the parallel execution of a group of processes with a single library call is reported. The number and location of these processes are determined by the operating system based on system load information. The DSM system proposed has a novel approach in that it provides programmers with a complete programming environment in which they are easily able to develop and run their code or indeed run existing shared memory code. A set of demanding DSM system design requirements are presented and the incentives for the placement of the DSM system with a distributed operating system and in particular in the memory management server have been reported. The new DSM system concentrated on an event-driven set of cooperating and distributed entities, and a detailed description of the events and reactions to these events that make up the operation of the DSM system is then presented. This is followed by a pseudocode form of the detailed design of the main modules and activities of the primitives used in the proposed DSM system. Quantitative results of performance tests and qualitative results showing the ease of programming and use of the RHODOS DSM system are reported. A study of five different application is given and the results of tests carried out on these applications together with a discussion of the results are given. A discussion of how RHODOS’ DSM allows programmers to write shared memory code in an easy to use and familiar environment and a comparative evaluation of RHODOS DSM with other DSM systems is presented. In particular, the ease of use and transparency of the DSM system have been demonstrated through the description of the ease with which a moderately inexperienced undergraduate programmer was able to convert, write and run applications for the testing of the DSM system. Furthermore, the description of the tests performed using physically shared memory shows that the latter is indistinguishable from distributed shared memory; this is further evidence that the DSM system is fully transparent. This study clearly demonstrates that the aim of the research has been achieved; it is possible to develop a programmer friendly and efficient DSM system fully integrated within a distributed operating system. It is clear from this research that client-server and microkernel based distributed operating system integrated DSM makes shared memory operations transparent and almost completely removes the involvement of the programmer beyond classical activities needed to deal with shared memory. The conclusion can be drawn that DSM, when implemented within a client-server and microkernel based distributed operating system, is one of the most encouraging approaches to parallel processing since it guarantees performance improvements with minimal programmer involvement.

Management of SPMD based parallel processing on clusters of workstations

Current attempts to manage parallel applications on Clusters of Workstations (COWs) have either generally followed the parallel execution environment approach or been extensions to existing network operating systems, both of which do not provide complete or satisfactory solutions. The efficient and transparent management of parallelism within the COW environment requires enhanced methods of process instantiation, mapping of parallel process to workstations, maintenance of process relationships, process communication facilities, and process coordination mechanisms. The aim of this research is to synthesise, design, develop and experimentally study a system capable of efficiently and transparently managing SPMD parallelism on a COW. This system should both improve the performance of SPMD based parallel programs and relieve the programmer from the involvement into parallelism management in order to allow them to concentrate on application programming. It is also the aim of this research to show that such a system, to achieve these objectives, is best achieved by adding new special services and exploiting the existing services of a client/server and microkernel based distributed operating system. To achieve these goals the research methods of the experimental computer science should be employed. In order to specify the scope of this project, this work investigated the issues related to parallel processing on COWs and surveyed a number of relevant systems including PVM, NOW and MOSIX. It was shown that although the MOSIX system provide a number of good services related to parallelism management, none of the system forms a complete solution. The problems identified with these systems include: instantiation services that are not suited to parallel processing; duplication of services between the parallelism management environment and the operating system; and poor levels of transparency. A high performance and transparent system capable of managing the execution of SPMD parallel applications was synthesised and the specific services of process instantiation, process mapping and process interaction detailed. The process instantiation service designed here provides the capability to instantiate parallel processes using either creation or duplication methods and also supports multiple and group based instantiation which is specifically design for SPMD parallel processing. The process mapping service provides the combination of process allocation and dynamic load balancing to ensure the load of a COW remains balanced not only at the time a parallel program is initialised but also during the execution of the program. The process interaction service guarantees to maintain transparently process relationships, communications and coordination services between parallel processes regardless of their location within the COW. The combination of these services provides an original architecture and organisation of a system that is capable of fully managing the execution of SPMD parallel applications on a COW. A logical design of a parallelism management system was developed derived from the synthesised system and was shown that it should ideally be based on a distributed operating system employing the client server model. The client/server based distributed operating system provides the level of transparency, modularity and flexibility necessary for a complete parallelism management system. The services identified in the synthesised system have been mapped to a set of server processes including: Process Instantiation Server providing advanced multiple and group based process creation and duplication; Process Mapping Server combining load collection, process allocation and dynamic load balancing services; and Process Interaction Server providing transparent interprocess communication and coordination. A Process Migration Server was also identified as vital to support both the instantiation and mapping servers. The RHODOS client/server and microkernel based distributed operating system was selected to carry out research into the detailed design and to be used for the implementation this parallelism management system. RHODOS was enhanced to provide the required servers and resulted in the development of the REX Manager, Global Scheduler and Process Migration Manager to provide the services of process instantiation, mapping and migration, respectively. The process interaction services were already provided within RHODOS and only required some extensions to the existing Process Manager and IPC Managers. Through a variety of experiments it was shown that when this system was used to support the execution of SPMD parallel applications the overall execution times were improved, especially when multiple and group based instantiation services are employed. The RHODOS PMS was also shown to greatly reduce the programming burden experienced by users when writing SPMD parallel applications by providing a small set of powerful primitives specially designed to support parallel processing. The system was also shown to be applicable and has been used in a variety of other research areas such as Distributed Shared Memory, Parallelising Compilers and assisting the port of PVM to the RHODOS system. The RHODOS Parallelism Management System (PMS) provides a unique and creative solution to the problem of transparently and efficiently controlling the execution of SPMD parallel applications on COWs. Combining advanced services such as multiple and group based process creation and duplication; combined process allocation and dynamic load balancing; and complete COW wide transparency produces a totally new system that addresses many of the problems not addressed in other systems.

Construction of k-Lipschitz triangular norms and conorms from empirical data

This paper examines the practical construction of k-Lipschitz triangular norms and conorms from empirical data. We apply a characterization of such functions based on k-convex additive generators and translate k-convexity of piecewise linear strictly decreasing functions into a simple set of linear inequalities on their coefficients. This is the basis of a simple linear spline-fitting algorithm, which guarantees k-Lipschitz property of the resulting triangular norms and conorms.

On Lipschitz properties of generated aggregation functions

This article discusses Lipschitz properties of generated aggregation functions. Such generated functions include triangular norms and conorms, quasi-arithmetic means, uninorms, nullnorms and continuous generated functions with a neutral element. The Lipschitz property guarantees stability of aggregation operations with respect to input inaccuracies, and is important for applications. We provide verifiable sufficient conditions to determine when a generated aggregation function holds the k-Lipschitz property, and calculate the Lipschitz constants of power means. We also establish sufficient conditions which guarantee that a generated aggregation function is not Lipschitz. We found the only 1-Lipschitz generated function with a neutral element e ∈]0, 1[.

An anonymity revocation technology for anonymous communication

A number of privacy-enhancing technologies (PETs) have been proposed in the last three decades offering unconditional communication anonymity to their users. Unconditional anonymity can, however, be a security threat because it allows users to employ a PET in order to act maliciously while hiding their identity. In the last few years, several technologies which revoke the identity of users who use PETs have been proposed. These are known as anonymity revocation technologies (ARTs). However, the construction of ARTs has been developed in an ad hoc manner without a theoretical basis outlining the goals and underlying principles. In this chapter we present a set of fundamental principles and requirements for construction of an ART, identifying the necessary features. We then propose an abstract scheme for construction of an ART based on these features.

Vision-based target tracking and surveillance with robust set-valued state estimation

Tracking a target from a video stream (or a sequence of image frames) involves nonlinear measurements in Cartesian coordinates. However, the target dynamics, modeled in Cartesian coordinates, result in a linear system. We present a robust linear filter based on an analytical nonlinear to linear measurement conversion algorithm. Using ideas from robust control theory, a rigorous theoretical analysis is given which guarantees that the state estimation error for the filter is bounded, i.e., a measure against filter divergence is obtained. In fact, an ellipsoidal set-valued estimate is obtained which is guaranteed to contain the true target location with an arbitrarily high probability. The algorithm is particularly suited to visual surveillance and tracking applications involving targets moving on a plane.

Finding rule groups to classify high dimensional gene expression datasets

Microarray data provides quantitative information about the transcription profile of cells. To analyse microarray datasets, methodology of machine learning has increasingly attracted bioinformatics researchers. Some approaches of machine learning are widely used to classify and mine biological datasets. However, many gene expression datasets are extremely high dimensionality, traditional machine learning methods cannot be applied effectively and efficiently. This paper proposes a robust algorithm to find out rule groups to classify gene expression datasets. Unlike the most classification algorithms, which select dimensions (genes) heuristically to form rules groups to identify classes such as cancerous and normal tissues, our algorithm guarantees finding out best-k dimensions (genes) to form rule groups for the classification of expression datasets. Our experiments show that the rule groups obtained by our algorithm have higher accuracy than that of other classification approaches.