Agency theory and culture : implications for research in management control systems

The objective of this paper is to encourage further research into the applicability of agency theory for the study of management control issues of organisations in Asian societies.

International examples of large-scale systems-theory and practice IV: B2B e-commerce implementation in the Australian context

Two of the most commonly used classifications in IS research are the factor approach and the process approach. While many studies of IS implementation are undertaken using a factor approach, little research so far examines the process of e-commerce implementation, especially in relation to the implementation of e-commerce in business-to-business (B2B) relationships. A holistic understanding of implementation which combines both the factor and process approaches using a case study method, is suggested as particularly suitable because of its ability to capture the reality of e-commerce implementation in an organisation's natural environment and in much greater detail than is possible using one of these approaches alone. In this paper, therefore, we endeavour to contribute to what we perceive as a gap in the body of theory surrounding the implementation process in the business-to-business e-commerce literature. We describe the findings of multiple case studies involving ten major Australian e-commerce initiators. In addition to confirming our earlier finding of the importance of non-technical factors for the success of the implementation process we also present, through our case studies, the various management and business issues associated with the success or failure of B2B e-commerce implementation.

A logical framework for knowledge sharing in multi-agent systems

The issue of knowledge sharing has been an important topic in multi-agent research. Knowledge sharing leads to that agents analyze, judge and synthesize the told information so as to make agents’ own knowledge. To match these applications, this paper builds a logical framework for knowledge sharing among agents. We develop a multimodal logic for reasoning about both agents’ knowledge and told information. For formalizing the relationship between knowledge and told information, we present a framework of semantics, with respect to which a sound and complete proof theory is given.

Simulation and visualization of fire using extended Lindenmayer systems

This research introduces a method of using Lindenmayer Systems to model the spreading and behavior of fire inside a factory building. The research investigates the use of L-System propagated fires for determining factors such as where the fire is most likely to spread first and how fast. It also looks at an alternative way of storing the Lindenmayer System, not in the form of a string but rather as a graph. A variation on the building and traversal process is also investigated, in which the L-System is traversed depth first instead of breadth first. Results of fire propagation are presented and we conclude that L-Systems are a suitable tool for fire propagation.

State of multilevel research perspective in the information systems discipline

Existing distinctions among macro and micro approaches have been jeopardising the advances of Information Systems (IS) research. Both approaches have been criticized for explaining one level while neglecting the other; thereby, the current situation necessitates the application of multilevel research for revealing the deficiencies. Instead of studying single level (macro or micro), multilevel research entails more than one level of conceptualization and analysis, simultaneously. As the notion of multilevel is borrowed from reference disciplines, there tends to be confusions and inconsistencies within the IS discipline, which hinders the adoption of multilevel research. This paper speaks for the potential value of multilevel research, by investigating the current application status of multilevel research within the IS domain. A content analysis of multilevel research articles from major IS conferences and journals is presented. Analysis results suggest that IS scholars have applied multilevel research to produce high quality work ranging from a variety of topics. However, researchers have not yet been consistently defining “multilevel”, leading to idiosyncratic meanings of multilevel research, most often, in authors’ own interpretations. We argue that a rigorous definition of “multilevel research” needs to be explicated for consistencies in research community.

Global software development : measuring, approximating and reducing the complexity of global software development using extended axiomatic design theory

This paper considers GSD projects as designed artefacts, and proposes the application of an Extended Axiomatic Design theory to reduce their complexity in order to increase the probability of project success. Using an upper bound estimation of the Kolmogorov complexity of the so-called ‘design matrix’ (as a proxy of Information Content as a complexity measure) we demonstrate on two hypothetical examples how good and bad designs of GSD planning compare in terms of complexity. We also demonstrate how to measure and calculate the ‘structural’ complexity of GSD projects and show that by satisfying all design axioms this ‘structural’ complexity could be minimised.

AMC: an adaptive multi-level cache algorithm in hybrid storage systems

Hybrid storage systems that consist of flash-based solid state drives (SSDs) and traditional disks are now widely used. In hybrid storage systems, there exists a two-level cache hierarchy that regard dynamic random access memory (DRAM) as the first level cache and SSD as the second level cache for disk storage. However, this two-level cache hierarchy typically uses independent cache replacement policies for each level, which makes cache resource management inefficient and reduces system performance. In this paper, we propose a novel adaptive multi-level cache (AMC) replacement algorithm in hybrid storage systems. The AMC algorithm adaptively adjusts cache blocks between DRAM and SSD cache levels using an integrated solution. AMC uses combined selective promote and demote operations to dynamically determine the level in which the blocks are to be cached. In this manner, the AMC algorithm achieves multi-level cache exclusiveness and makes cache resource management more efficient. By using real-life storage traces, our evaluation shows the proposed algorithm improves hybrid multi-level cache performance and also increases the SSD lifetime compared with traditional multi-level cache replacement algorithms.

Small cluster in cyber physical systems: network topology, interdependence and cascading failures

In cyber physical system (CPS), computational resources and physical resources are strongly correlated and mutually dependent. Cascading failures occur between coupled networks, cause the system more fragile than single network. Besides widely used metric giant component, we study small cluster (small component) in interdependent networks after cascading failures occur. We first introduce an overview on how small clusters distribute in various single networks. Then we propose a percolation theory based mathematical method to study how small clusters be affected by the interdependence between two coupled networks. We prove that the upper bounds exist for both the fraction and the number of operating small clusters. Without loss of generality, we apply both synthetic network and real network data in simulation to study small clusters under different interdependence models and network topologies. The extensive simulations highlight our findings: except the giant component, considerable proportion of small clusters exists, with the remaining part fragmenting to very tiny pieces or even massive isolated single vertex; no matter how the two networks are tightly coupled, an upper bound exists for the size of small clusters. We also discover that the interdependent small-world networks generally have the highest fractions of operating small clusters. Three attack strategies are compared: Inter Degree Priority Attack, Intra Degree Priority Attack and Random Attack. We observe that the fraction of functioning small clusters keeps stable and is independent from the attack strategies.

Trust, security and privacy in emerging distributed systems FGCS

The rapid development and increasing complexity of computer systems and communication networks coupled with the proliferation of services and applications in both Internet-based and ad-hoc based environments have brought network and system security issues to the fore. We have been witnessing ever-increasing cyber attacks on the network and system leading to tarnished confidence and trusts in the use of networked distributed systems. As a result, there is an increasing demand for development of new trust, security and privacy approaches to guarantee the privacy, integrity, and availability of resources in networked distributed systems.

Applying systems theory to the evaluation of a whole school approach to violence prevention

Issue addressed: Our Watch led a complex 12-month evaluation of a whole school approach to Respectful Relationships Education (RRE) implemented in 19 schools. RRE is an emerging field aimed at preventing gender-based violence. This paper will illustrate how from an implementation science perspective, the evaluation was a critical element in the change process at both a school and policy level. Methods: Using several conceptual approaches from systems science, the evaluation sought to examine how the multiple systems layers – student, teacher, school, community and government – interacted and influenced each other. A distinguishing feature of the evaluation included ‘feedback loops’; that is, evaluation data was provided to participants as it became available. Evaluation tools included a combination of standardised surveys (with pre- and post-intervention data provided to schools via individualised reports), reflection tools, regular reflection interviews and summative focus groups. Results: Data was shared during implementation with project staff, department staff and schools to support continuous improvement at these multiple systems levels. In complex settings, implementation can vary according to context; and the impact of evaluation processes, tools and findings differed across the schools. Interviews and focus groups conducted at the end of the project illustrated which of these methods were instrumental in motivating change and engaging stakeholders at both a school and departmental level and why. Conclusion: The evaluation methods were a critical component of the pilot’s approach, helping to shape implementation through data feedback loops and reflective practice for ongoing, responsive and continuous improvement. Future health promotion research on complex interventions needs to examine how the evaluation itself is influencing implementation. So what? The pilot has demonstrated that the evaluation, including feedback loops to inform project activity, were an asset to implementation. This has implications for other health promotion activities, where evaluation tools could be utilised to enhance, rather than simply measure, an intervention. The findings are relevant to a range of health promotion research activities because they demonstrate the importance of meta-evaluation techniques that seek to understand how the evaluation itself was influencing implementation and outcomes.

A market-oriented hierarchical scheduling strategy in cloud workflow systems

A cloud workflow system is a type of platform service which facilitates the automation of distributed applications based on the novel cloud infrastructure. One of the most important aspects which differentiate a cloud workflow system from its other counterparts is the market-oriented business model. This is a significant innovation which brings many challenges to conventional workflow scheduling strategies. To investigate such an issue, this paper proposes a market-oriented hierarchical scheduling strategy in cloud workflow systems. Specifically, the service-level scheduling deals with the Task-to-Service assignment where tasks of individual workflow instances are mapped to cloud services in the global cloud markets based on their functional and non-functional QoS requirements; the task-level scheduling deals with the optimisation of the Task-to-VM (virtual machine) assignment in local cloud data centres where the overall running cost of cloud workflow systems will be minimised given the satisfaction of QoS constraints for individual tasks. Based on our hierarchical scheduling strategy, a package based random scheduling algorithm is presented as the candidate service-level scheduling algorithm and three representative metaheuristic based scheduling algorithms including genetic algorithm (GA), ant colony optimisation (ACO), and particle swarm optimisation (PSO) are adapted, implemented and analysed as the candidate task-level scheduling algorithms. The hierarchical scheduling strategy is being implemented in our SwinDeW-C cloud workflow system and demonstrating satisfactory performance. Meanwhile, the experimental results show that the overall performance of ACO based scheduling algorithm is better than others on three basic measurements: the optimisation rate on makespan, the optimisation rate on cost and the CPU time.

Information sharing in supply chain systems

This chapter considers the importance of information-sharing techniques and strategies employed by industry sectors. Well-developed supply chain management often brings with it improved buyer-supplier communication processes, and we consider the impact of these not only from an intersector point of view, but also from a cross-sector viewpoint. The particular perspectives of the small business within a supply chain structure and of the supply chain customer are examined in detail. We conclude that information sharing is a critical component of business success both inside and outside the supply chain structure. However, while globally and at the large business level, both development and implementation of such technologies have mushroomed, smaller enterprises have tended to be left behind to cope as best they can with multiple pressures to conform.

Production of Australian freshwater crayfish in earthen-based systems using pelleted diets and forage crops as food

Juvenile Cherax destructor (commonly called theyabby) were cultured in earthen-based ponds and tanks for 70–105d, and were fed pellets and/or a forage crop of the perennialwhiteclover, Trifolium repens. Three supplementary feedingstrategies were evaluated. Yabby growth on pellets consistently exceeded (by67–159%) that obtained on clover. Base-line yields for extensiveproduction systems are around 400 kg ha^–1. Thesupplementary addition of T. repens produced yields of 635kg ha^–1 (in ponds) to 1086 kgha^–1 (in tanks). The sequential addition of cut-cloverto tanks stimulated growth to levels approaching those achieved on pellets.Yabbies stocked into ponds at 17 m^–2 and fed 33%protein pellets for 100 d, resulted in a yield of 1117 kgha^–1.Pellet inputs at a rate of 129–249 g m^–2(dry matter) and 38–83 g m^–2 (protein) over70–100 d resulted in acceptable growth and feed utilisationindices. Clover inputs of 534–682 g m–2 (asdry matter) or 84–177 g m^–2 (as protein)produced reasonable growth rates but poor feed utilisation indices. Aconsiderable quantity of the dry matter and protein content of clover waseitherinefficiently utilised or directed into other production pathways. In tanks,clover inputs from 113–296 g m^–2 (drymatter) and 24–54 g m^–2 (protein) weresufficient to maintain high growth rates for 4 weeks, while in ponds, inputs of21 g m^–2 (dry matter) and 4.3 gm^–2 (protein) were sufficient for 3 weeks. During theearly weeks of production no growth advantage was gained by providing pelletstoanimals cultured in forage-based systems. Forage depletion occurred after3–4 weeks and was probably a major growth limiting factor.

An analysis of update ordering in distributed replication systems

This paper analyses update ordering and its impact on the performance of a distributed replication system. We propose a model for update orderings and constraints and develop a number of algorithms for implementing different ordering constraints. A performance study is then carried out to analyse the update-ordering model. We show that our model allows the definition of an ordering constraint on each update operation, and the ordering implementation takes account of detailed inter-operation semantics denoted by commutative operations and causal operations to reduce unnecessary delay and results in a better response time for update requests.