Development sites in the empty city : from picture book to performance

Picturebooks invite performance every time they are read. What happens to them when they’re adapted for live performance? This ongoing practice led research project (2008-) regenerates and transforms picturebook The Empty City (Hachette/Livre 2007) by David Megarrity and Jonathon Oxlade into a live experience. In this rebuilding, interanimation of text and illustration on the picturebook page suddenly open up into a new and complex structure incorporating composition of music, animation, live action, projected image and performing objects. The presenter is the creator of both the source text and writer/composer of the adaptation, providing a unique vantage point that draws on sources from both within and without the creative process up to and including audience reception. From the foundations up, this paper’s focus is on deep, muddy sites of development in the adaptation process, unearthed treasures, and how perceptions of fear and safety push, sway and stress the building of a new performance work for children in content, form and process.

Defending web services against denial of service attacks using client puzzles

The interoperable and loosely-coupled web services architecture, while beneficial, can be resource-intensive, and is thus susceptible to denial of service (DoS) attacks in which an attacker can use a relatively insignificant amount of resources to exhaust the computational resources of a web service. We investigate the effectiveness of defending web services from DoS attacks using client puzzles, a cryptographic countermeasure which provides a form of gradual authentication by requiring the client to solve some computationally difficult problems before access is granted. In particular, we describe a mechanism for integrating a hash-based puzzle into existing web services frameworks and analyze the effectiveness of the countermeasure using a variety of scenarios on a network testbed. Client puzzles are an effective defence against flooding attacks. They can also mitigate certain types of semantic-based attacks, although they may not be the optimal solution.

Information extraction from web services : a comparison of Tokenisation algorithms

Most web service discovery systems use keyword-based search algorithms and, although partially successful, sometimes fail to satisfy some users information needs. This has given rise to several semantics-based approaches that look to go beyond simple attribute matching and try to capture the semantics of services. However, the results reported in the literature vary and in many cases are worse than the results obtained by keyword-based systems. We believe the accuracy of the mechanisms used to extract tokens from the non-natural language sections of WSDL files directly affects the performance of these techniques, because some of them can be more sensitive to noise. In this paper three existing tokenization algorithms are evaluated and a new algorithm that outperforms all the algorithms found in the literature is introduced.

GPFlow: an intuitive environment for web-based scientific workflow

Increasingly scientists are using collections of software tools in their research. These tools are typically used in concert, often necessitating laborious and error-prone manual data reformatting and transfer. We present an intuitive workflow environment to support scientists with their research. The workflow, GPFlow, wraps legacy tools, presenting a high level, interactive web-based front end to scientists. The workflow backend is realized by a commercial grade workflow engine (Windows Workflow Foundation). The workflow model is inspired by spreadsheets and is novel in its support for an intuitive method of interaction enabling experimentation as required by many scientists, e.g. bioinformaticians. We apply GPFlow to two bioinformatics experiments and demonstrate its flexibility and simplicity.

Resource allocation and scheduling of multiple composite web services in cloud computing using cooperative coevolution genetic algorithm

In cloud computing, resource allocation and scheduling of multiple composite web services is an important and challenging problem. This is especially so in a hybrid cloud where there may be some low-cost resources available from private clouds and some high-cost resources from public clouds. Meeting this challenge involves two classical computational problems: one is assigning resources to each of the tasks in the composite web services; the other is scheduling the allocated resources when each resource may be used by multiple tasks at different points of time. In addition, Quality-of-Service (QoS) issues, such as execution time and running costs, must be considered in the resource allocation and scheduling problem. Here we present a Cooperative Coevolutionary Genetic Algorithm (CCGA) to solve the deadline-constrained resource allocation and scheduling problem for multiple composite web services. Experimental results show that our CCGA is both efficient and scalable.

Approximate Membership Localization within a Web-Based Join Framework

In this paper, we propose a search-based approach to join two tables in the absence of clean join attributes. Non-structured documents from the web are used to express the correlations between a given query and a reference list. To implement this approach, a major challenge we meet is how to efficiently determine the number of times and the locations of each clean reference from the reference list that is approximately mentioned in the retrieved documents. We formalize the Approximate Membership Localization (AML) problem and propose an efficient partial pruning algorithm to solve it. A study using real-word data sets demonstrates the effectiveness of our search-based approach, and the efficiency of our AML algorithm.

CDKN2A mutation in a non-FAMMM kindred with cancers at multiple sites results in a functionally abnormal protein

The CDKN2A gene encodes p16 (CDKN2A), a cell-cycle inhibitor protein which prevents inappropriate cell cycling and, hence, proliferation. Germ-line mutations in CDKN2A predispose to the familial atypical multiple-mole melanoma (FAMMM) syndrome but also have been seen in rare families in which only 1 or 2 individuals are affected by cutaneous malignant melanoma (CMM). We therefore sequenced exons 1alpha and 2 of CDKN2A using lymphocyte DNA isolated from index cases from 67 families with cancers at multiple sites, where the patterns of cancer did not resemble those attributable to known genes such as hMLH1, hMLH2, BRCA1, BRCA2, TP53 or other cancer susceptibility genes. We found one mutation, a mis-sense mutation resulting in a methionine to isoleucine change at codon 53 (M531) of exon 2. The individual tested had developed 2 CMMs but had no dysplastic nevi and lacked a family history of dysplastic nevi or CMM. Other family members had been diagnosed with oral cancer (2 persons), bladder cancer (1 person) and possibly gall-bladder cancer. While this mutation has been reported in Australian and North American melanoma kindreds, we did not observe it in 618 chromosomes from Scottish and Canadian controls. Functional studies revealed that the CDKN2A variant carrying the M531 change was unable to bind effectively to CDK4, showing that this mutation is of pathological significance. Our results have confirmed that CDKN2A mutations are not limited to FAMMM kindreds but also demonstrate that multi-site cancer families without melanoma are very unlikely to contain CDKN2A mutations.

Leveraging Web 2.0 data for scalable semi-supervised learning of domain-specific sentiment lexicons

Since manually constructing domain-specific sentiment lexicons is extremely time consuming and it may not even be feasible for domains where linguistic expertise is not available. Research on the automatic construction of domain-specific sentiment lexicons has become a hot topic in recent years. The main contribution of this paper is the illustration of a novel semi-supervised learning method which exploits both term-to-term and document-to-term relations hidden in a corpus for the construction of domain specific sentiment lexicons. More specifically, the proposed two-pass pseudo labeling method combines shallow linguistic parsing and corpusbase statistical learning to make domain-specific sentiment extraction scalable with respect to the sheer volume of opinionated documents archived on the Internet these days. Another novelty of the proposed method is that it can utilize the readily available user-contributed labels of opinionated documents (e.g., the user ratings of product reviews) to bootstrap the performance of sentiment lexicon construction. Our experiments show that the proposed method can generate high quality domain-specific sentiment lexicons as directly assessed by human experts. Moreover, the system generated domain-specific sentiment lexicons can improve polarity prediction tasks at the document level by 2:18% when compared to other well-known baseline methods. Our research opens the door to the development of practical and scalable methods for domain-specific sentiment analysis.

Adolescent experiences of 'family meals' in Australia

Popular discourse laments the decline of the ‘family meal’, leading to family fragmentation and nutritional compromise. This article reports findings of a study investigating beliefs and practices surrounding the ‘family meal’, using data drawn from an on-line survey completed by 625 adolescents in Perth, Western Australia. The results challenge current concerns about the loss of the ‘family meal’, demonstrating that, for a majority, meals are eaten together rather than in isolation; are home-made rather than store bought or fast food; and are sites of conversation regardless of the presence of a television. Adolescents are divided, however, on the value of the ‘family meal’, with half seeing it as a positive experience of family togetherness and half regarding it negatively or as unimportant. The findings go some way to dispelling the notion that the ‘family meal’ no longer exists in Australia.

QoS-aware web service composition using genetic algorithms

Web service technology is increasingly being used to build various e-Applications, in domains such as e-Business and e-Science. Characteristic benefits of web service technology are its inter-operability, decoupling and just-in-time integration. Using web service technology, an e-Application can be implemented by web service composition — by composing existing individual web services in accordance with the business process of the application. This means the application is provided to customers in the form of a value-added composite web service. An important and challenging issue of web service composition, is how to meet Quality-of-Service (QoS) requirements. This includes customer focused elements such as response time, price, throughput and reliability as well as how to best provide QoS results for the composites. This in turn best fulfils customers’ expectations and achieves their satisfaction. Fulfilling these QoS requirements or addressing the QoS-aware web service composition problem is the focus of this project. From a computational point of view, QoS-aware web service composition can be transformed into diverse optimisation problems. These problems are characterised as complex, large-scale, highly constrained and multi-objective problems. We therefore use genetic algorithms (GAs) to address QoS-based service composition problems. More precisely, this study addresses three important subproblems of QoS-aware web service composition; QoS-based web service selection for a composite web service accommodating constraints on inter-service dependence and conflict, QoS-based resource allocation and scheduling for multiple composite services on hybrid clouds, and performance-driven composite service partitioning for decentralised execution. Based on operations research theory, we model the three problems as a constrained optimisation problem, a resource allocation and scheduling problem, and a graph partitioning problem, respectively. Then, we present novel GAs to address these problems. We also conduct experiments to evaluate the performance of the new GAs. Finally, verification experiments are performed to show the correctness of the GAs. The major outcomes from the first problem are three novel GAs: a penaltybased GA, a min-conflict hill-climbing repairing GA, and a hybrid GA. These GAs adopt different constraint handling strategies to handle constraints on interservice dependence and conflict. This is an important factor that has been largely ignored by existing algorithms that might lead to the generation of infeasible composite services. Experimental results demonstrate the effectiveness of our GAs for handling the QoS-based web service selection problem with constraints on inter-service dependence and conflict, as well as their better scalability than the existing integer programming-based method for large scale web service selection problems. The major outcomes from the second problem has resulted in two GAs; a random-key GA and a cooperative coevolutionary GA (CCGA). Experiments demonstrate the good scalability of the two algorithms. In particular, the CCGA scales well as the number of composite services involved in a problem increases, while no other algorithms demonstrate this ability. The findings from the third problem result in a novel GA for composite service partitioning for decentralised execution. Compared with existing heuristic algorithms, the new GA is more suitable for a large-scale composite web service program partitioning problems. In addition, the GA outperforms existing heuristic algorithms, generating a better deployment topology for a composite web service for decentralised execution. These effective and scalable GAs can be integrated into QoS-based management tools to facilitate the delivery of feasible, reliable and high quality composite web services.

Intelligent computing and sensing for active safety on construction sites

On obstacle-cluttered construction sites where heavy equipment is in use, safety issues are of major concern. The main objective of this paper is to develop a framework with algorithms for obstacle avoidance and path planning based on real-time three-dimensional job site models to improve safety during equipment operation. These algorithms have the potential to prevent collisions between heavy equipment vehicles and other on-site objects. In this study, algorithms were developed for image data acquisition, real-time 3D spatial modeling, obstacle avoidance, and shortest path finding and were all integrated to construct a comprehensive collision-free path. Preliminary research results show that the proposed approach is feasible and has the potential to be used as an active safety feature for heavy equipment.

An investigation of unique challenges in National Historic relics and scenic sites (NHRSSs) in Chinese research literature 1982-2008 using co-word analysis

National Housing Relics and Scenic Sites (NHRSSs) in China are the equivalent of National Parks in the West but have contrasting features and broader roles when compared to their Western counterparts. By reviewing and analysing more than 370 academic sources, this paper identifies 6 major issue clusters and future challenges that will influence the management of NHRSSs over time. It also provides a number of cases to illustrate the particular features of NHRSSs. Identifying the hot issues and important challenges in Chinese NHRSSs will provide valuable insights into priorities now being discussed in highly populated areas of the World.